Decompositions for the edge colouring of reduced indifference graphs.

DOI10.1016/S0304-3975(02)00636-9zbMath1044.68139OpenAlexW2038902506MaRDI QIDQ1401296

João Meidanis, Célia Picinin de Mello, Carmen Z. Ortiz, Celina M. Herrera de Figueiredo

Publication date: 17 August 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00636-9

zbMATH Keywords

AlgorithmsGraph algorithmsIndifference graphsEdge colouring

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (4)

Edge-colouring and total-colouring chordless graphs ⋮ Canonical antichains of unit interval and bipartite permutation graphs ⋮ Minimal classes of graphs of unbounded clique-width ⋮ Chromatic index of graphs with no cycle with a unique chord

Cites Work

• Unnamed Item
• Total-chromatic number and chromatic index of dually chordal graphs
• A linear-time algorithm for proper interval graph recognition
• Clique graphs of time graphs
• Two conjectures on edge-colouring
• NP-completeness of edge-colouring some restricted graphs
• A constructive proof of Vizing's theorem
• On edge-colouring indifference graphs
• Minimum proper interval graphs
• On the compatibility between a graph and a simple order
• The NP-Completeness of Edge-Coloring
• Difference graphs

This page was built for publication: Decompositions for the edge colouring of reduced indifference graphs.