A Quick Proof of Wagner's Equivalence Theorem

DOI10.1112/JLMS/S2-3.4.661zbMath0215.33703OpenAlexW2129160930MaRDI QIDQ5618393

H. Peyton Young

Publication date: 1971

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/jlms/s2-3.4.661

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Connected cutsets of a graph and triangle bases of the cycle space ⋮ On Tutte's extension of the four-colour problem ⋮ Tight upper bound on the number of edges in a bipartite \(K_{3,3}\)-free or \(K_{5}\)-free graph with an application.

This page was built for publication: A Quick Proof of Wagner's Equivalence Theorem