Graphs with valency k, edge connectivity k, chromatic index k+1 and arbitrary girth

DOI10.1016/0012-365X(73)90168-4zbMath0264.05110MaRDI QIDQ2561602

Jan Mycielski, Vance Faber

Publication date: 1973

Published in: Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Parallel concepts in graph theory
• On the algebraic theory of graph colorings
• The Colour Numbers of Complete Graphs
• Regular Graphs with Given Girth and Restricted Circuits
• Network-Colourings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Graphs with valency k, edge connectivity k, chromatic index k+1 and arbitrary girth