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

DOI10.1016/0012-365X(73)90168-4zbMATH Open0264.05110MaRDI QIDQ2561602FDOQ2561602

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

• Title not available (Why is that?)
• On the algebraic theory of graph colorings
• Title not available (Why is that?)
• Parallel concepts in graph theory
• The Colour Numbers of Complete Graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Regular Graphs with Given Girth and Restricted Circuits
• Title not available (Why is that?)
• Network-Colourings
• Title not available (Why is that?)

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)