scientific article; zbMATH DE number 19203

zbMATH Open0737.05050MaRDI QIDQ3976633FDOQ3976633

Authors: E. Schmeichel, John Mitchem 

Publication date: 26 June 1992

Title of this publication is not available (Why is that?)

Recommendations

• Two conjectures on edge-colouring
• Recent progress on edge-colouring graphs
• Edge coloring graphs with large minimum degree
• Chromatic index of dense quasirandom graphs

zbMATH Keywords

overfull graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (8)

• Title not available (Why is that?)
• Recent progress on edge-colouring graphs
• Improved edge-coloring algorithms for planar graphs
• How to find overfull subgraphs in graphs with large maximum degree. II
• Edge colorings of planar graphs with maximum degree five.
• Edge-partitions of planar graphs and their game coloring numbers
• How to find overfull subgraphs in graphs with large maximum degree
• The chromatic index of complete multipartite graphs

This page was built for publication:

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