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

DOI10.1016/0012-365X(73)90168-4MaRDI QIDQ2561602zbMATH OpenFDO

Authors 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

• scientific article; zbMATH DE number 3236772 (Why is no real title available?)
• scientific article; zbMATH DE number 3241107 (Why is no real title available?)
• scientific article; zbMATH DE number 3325506 (Why is no real title available?)
• scientific article; zbMATH DE number 3338381 (Why is no real title available?)
• scientific article; zbMATH DE number 3340107 (Why is no real title available?)
• scientific article; zbMATH DE number 3189017 (Why is no real title available?)
• Network-Colourings
• On the algebraic theory of graph colorings
• Parallel concepts in graph theory
• Regular Graphs with Given Girth and Restricted Circuits
• The Colour Numbers of Complete Graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2561602)