Excluding Minors in Cubic Graphs

DOI10.1017/S0963548300001838zbMath0854.05043OpenAlexW2125460346MaRDI QIDQ4883062

No author found.

Publication date: 1 July 1996

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548300001838

zbMATH Keywords

cubic graphPetersen graphPetersen minoredge-3-colorable

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Face extensions in planar cubic graphs

Cites Work

• Matching structure and the matching lattice
• On Tutte's extension of the four-colour problem
• Über eine Eigenschaft der ebenen Komplexe
• The NP-Completeness of Edge-Coloring
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• On the algebraic theory of graph colorings

This page was built for publication: Excluding Minors in Cubic Graphs