Indecomposabler-graphs and some other counterexamples

DOI<1::AID-JGT1>3.0.CO;2-B 10.1002/(SICI)1097-0118(199909)32:1<1::AID-JGT1>3.0.CO;2-BzbMath0932.05072OpenAlexW4205617459MaRDI QIDQ4265583

Romeo Rizzi

Publication date: 22 September 1999

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199909)32:1<1::aid-jgt1>3.0.co;2-b

zbMATH Keywords

regular graphPetersen graph1-factorsFulkerson coloringindecomposable graphpoorly matchable

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (6)

Superposition and constructions of graphs without nowhere-zero \(k\)-flows ⋮ An Upper Bound for the Excessive Index of an r‐Graph ⋮ Highly edge‐connected regular graphs without large factorizable subgraphs ⋮ Hamilton cycles in 5-connected line graphs ⋮ On the existence of graphs which can colour every regular graph ⋮ Pairwise Disjoint Perfect Matchings in r-Edge-Connected r-Regular Graphs

Cites Work

• Maximum matching and a polyhedron with 0,1-vertices
• Unnamed Item

This page was built for publication: Indecomposabler-graphs and some other counterexamples