The chromatic index of graphs with large maximum degree

DOI10.1016/0012-365X(83)90074-2zbMath0528.05028MaRDI QIDQ786820

Michael J. Plantholt

Publication date: 1983

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

zbMATH Keywords

chromatic indexmaximum degree

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (17)

The chromatic index of nearly bipartite multigraphs ⋮ Coloring of a non-zero component graph associated with a finite dimensional vector space ⋮ Edge-colouring of join graphs ⋮ A \(\Delta\)-subgraph condition for a graph to be class 1 ⋮ Recent progress on edge-colouring graphs ⋮ The chromatic index of graphs with large even order \(n\) and minimum degree at least \(2n/3\) ⋮ Two conjectures on edge-colouring ⋮ On edge-colouring indifference graphs ⋮ The overfull conjecture on split-comparability and split-interval graphs ⋮ Graphs which are vertex-critical with respect to the edge-chromatic number ⋮ A survey on the Intersection graphs of ideals of rings ⋮ Edge and total coloring of interval graphs ⋮ The intersection graph of ideals of ℤm ⋮ Graphs which are vertex‐critical with respect to the edge‐chromatic class ⋮ Upper bounds on the maximum degree of class two graphs on surfaces ⋮ On edge-colouring indifference graphs ⋮ Chromatic-index-critical graphs of orders 13 and 14

Cites Work

• Unnamed Item
• Construction of class two graphs with maximum vertex degree three
• Parallel concepts in graph theory
• Some remarks on the chromatic index of a graph
• Investigations on an edge coloring problem
• On the edge-chromatic number of a graph
• The NP-Completeness of Edge-Coloring
• Multicoloring the incidentors of a weighted directed multigraph
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• The Solution of a Timetabling Problem

This page was built for publication: The chromatic index of graphs with large maximum degree