Pancyclic properties of the graph of some 0-1 polyhedra

DOI10.1016/0095-8956(84)90040-6zbMath0527.05044OpenAlexW2005283421MaRDI QIDQ595680

Denis Naddef

Publication date: 1984

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(84)90040-6

zbMATH Keywords

cyclesmatroid basis polytopesperfect matching polytopes

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35) Polytopes and polyhedra (52Bxx)

Related Items

Hamiltonicity of a type of interchange graphs, On the expansion of combinatorial polytopes, The Graph of the Pedigree Polytope is Asymptotically Almost Complete (Extended Abstract), Hamiltonicity in (0-1)-polyhedra

Cites Work

• Unnamed Item
• Unnamed Item
• Hamiltonicity in (0-1)-polyhedra
• Hamiltonicity and combinatorial polyhedra
• Pancyclic graphs. II
• On certain polytopes associated with graphs
• Pancyclic graphs. I
• Large cycles in graphs
• Matroid basis graphs. I