On the chromatic index of graphs with 2m+1 vertices and 2m^2 edges.

DOI10.1016/S0020-0190(98)00041-6MaRDI QIDQ2583545zbMATH OpenFDO

Authors Chongkye Rhee

Publication date 17 January 2006

Published in Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

AlgorithmsEdge coloringChromatic indexComplete graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Recommendations

• The chromatic index of graphs of even order with many edges
• scientific article; zbMATH DE number 4122017
• On the chromatic index of almost all graphs
• A note on the \((g,f)\)-chromatic index of graphs
• The chromatic index of graphs with large even order \(n\) and minimum degree at least \(2n/3\)
• scientific article; zbMATH DE number 4195987
• Publication:4206746
• The chromatic index of a graph whose core has maximum degree 2
• Acyclic chromatic indices of 2-outerplane graphs
• Acyclic chromatic indices of 2-outerplane graphs

Cites work

• Definitions of criticality with respect to edge-coloring
• The Colour Numbers of Complete Graphs
• The chromatic index of graphs with a spanning star

Cited in

(3)

• The chromatic index of complete multipartite graphs
• scientific article; zbMATH DE number 7225175 (Why is no real title available?)
• d‐Regular graphs of acyclic chromatic index at least d+2

This page was built for publication: On the chromatic index of graphs with \(2m+1\) vertices and \(2m^2\) edges.

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