On small graphs critical with respect to edge colourings

From MaRDI portal
Publication:1232418

DOI10.1016/0012-365X(76)90139-4zbMath0344.05121MaRDI QIDQ1232418

Lowell W. Beineke, Stanley Fiorini

Publication date: 1976

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




Related Items (24)

On the size of edge-chromatic critical graphsFinding Δ(Σ) for a surface σ of characteristic χ(Σ) = −5There are no edge-chromatic 4-critical graphs of order 12Hamiltonian cycles in critical graphs with large maximum degreeA Sufficient Condition for Edge Chromatic Critical Graphs to Be Hamiltonian—An Approach to Vizing's 2‐Factor ConjectureOn the size of graphs of class 2 whose cores have maximum degree twoLinear algorithms for edge-coloring trees and unicyclic graphsFinding \(\Delta (\Sigma)\) for a surface \(\Sigma \) of characteristic \(-6\) and \(-7\)Sizes of critical graphs with small maximum degreesLower bounds on the number of edges in edge-chromatic-critical graphs with fixed maximum degreesOn the average degree of critical graphs with maximum degree sixSome criteria for a graph to be class 1Edge coloring of graphs with small average degreesOn graphs critical with respect to edge-colouringsFinding the exact bound of the maximum degrees of class two graphs embeddable in a surface of characteristic \(\epsilon \in \{-1, -2, -3\}\)A note on class one graphs with maximum degree sixThe size of edge chromatic critical graphs with maximum degree 6Remarks on the critical graph conjectureClique-perfectness of complements of line graphsFinding Δ(Σ) for a Surface Σ of Characteristic −4New results on chromatic index critical graphsEdge coloring of graphs with small maximum degreesChromatic index critical graphs of order 9A brief history of edge-colorings – with personal reminiscences



Cites Work


This page was built for publication: On small graphs critical with respect to edge colourings