On Inverse-Image of Non-Oriented Graphs
作者： S. Perz , S. Rolewicz
DOI: 10.1007/978-3-642-46631-1_15
关键词:
摘要: By a non-oriented graph we shall call pair G= , where V is finite set, and A family of two-elements subsets V. The elements vertices, the edges.
springer.com
sci-hub.st 参考文章(13)
Dénes König, Theorie Der Endlichen Und Unendlichen Graphen ,(1965)
Manfred W. Padberg, Almost integral polyhedra related to certain combinatorial optimization problems Linear Algebra and its Applications. ,vol. 15, pp. 69- 88 ,(1976) , 10.1016/0024-3795(76)90079-3
L. Lovász, Normal hypergraphs and the perfect graph conjecture Discrete Mathematics. ,vol. 306, pp. 253- 267 ,(1972) , 10.1016/0012-365X(72)90006-4
Manfred W. Padberg, On the facial structure of set packing polyhedra Mathematical Programming. ,vol. 5, pp. 199- 215 ,(1973) , 10.1007/BF01580121
D. R. Fulkerson, Blocking and anti-blocking pairs of polyhedra Mathematical Programming. ,vol. 1, pp. 168- 194 ,(1971) , 10.1007/BF01584085
Manfred W. Padberg, Perfect zero–one matrices Mathematical Programming. ,vol. 6, pp. 180- 196 ,(1974) , 10.1007/BF01580235
V Chvátal, On certain polytopes associated with graphs Journal of Combinatorial Theory, Series B. ,vol. 18, pp. 138- 154 ,(1975) , 10.1016/0095-8956(75)90041-6
Mahlon M. Day, Reflexive Banach spaces not isomorphic to uniformly convex spaces Bulletin of the American Mathematical Society. ,vol. 47, pp. 313- 317 ,(1941) , 10.1090/S0002-9904-1941-07451-3
D.R Fulkerson, Anti-blocking polyhedra Journal of Combinatorial Theory, Series B. ,vol. 12, pp. 50- 71 ,(1972) , 10.1016/0095-8956(72)90032-9
L Lovász, A Characterization of Perfect Graphs Journal of Combinatorial Theory, Series B. ,vol. 13, pp. 95- 98 ,(1972) , 10.1016/0095-8956(72)90045-7