On critical graphs with chromatic index 4

DOI10.1016/0012-365X(74)90009-0zbMATH Open0298.05121MaRDI QIDQ1214435FDOQ1214435

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

• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• Title not available (Why is that?)
• Cubic identity graphs and planar graphs derived from trees
• Some remarks on the chromatic index of a graph
• On the edge-chromatic number of a graph
• Title not available (Why is that?)

Cited In (28)

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

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)