On critical graphs with chromatic index 4

DOI10.1016/0012-365X(74)90009-0MaRDI QIDQ1214435zbMATHFDO

Authors Ivan Tafteberg Jakobsen

Publication date 1974

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 3273761 (Why is no real title available?)
• scientific article; zbMATH DE number 3349744 (Why is no real title available?)
• Cubic identity graphs and planar graphs derived from trees
• On the edge-chromatic number of a graph
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• Some remarks on the chromatic index of a graph

Cited in

(28)

• Chromatic-index-critical graphs of orders 13 and 14
• The average degree of an edge-chromatic critical graph
• Remarks on the size of critical edge-chromatic graphs
• On the size of critical graphs with maximum degree 8
• Remarks on the critical graph conjecture
• On small graphs critical with respect to edge colourings
• Some remarks on Hajós' conjecture
• Chromatic index critical graphs of order 9
• Graph edge coloring: a survey
• Sizes of critical graphs with small maximum degrees
• On the average degree of critical graphs with maximum degree six
• On the size of edge chromatic critical graphs
• On the size of edge chromatic 5-critical graphs
• Edge coloring of graphs with small average degrees
• A Möbius-type gluing technique for obtaining edge-critical graphs
• New results on chromatic index critical graphs
• An analogy between edge colourings and differentiable manifolds, with a new perspective on 3-critical graphs
• Face-degree bounds for planar critical graphs
• Construction of class two graphs with maximum vertex degree three
• The average degree of edge chromatic critical graphs with maximum degree seven
• The size of edge chromatic critical graphs with maximum degree 6
• A note on the size of edge-chromatic 4-critical graphs
• Chromatic-index critical multigraphs of order 20
• On the average degree of edge chromatic critical graphs
• On graphs critical with respect to edge-colourings
• On the size of edge-chromatic critical graphs
• Average degrees of edge-chromatic critical graphs
• A sufficient condition for edge chromatic critical graphs to be Hamiltonian -- an approach to Vizing's 2-factor conjecture

This page was built for publication: On critical graphs with chromatic index 4

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