On edge-colouring indifference graphs

DOI10.1007/3-540-59175-3_96zbMath1498.05094OpenAlexW2172905486MaRDI QIDQ5096339

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

Publication date: 16 August 2022

Published in: LATIN '95: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59175-3_96

zbMATH Keywords

chromatic indexVizing's theorem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Characterizing and edge-colouring split-indifference graphs

Cites Work

• Unnamed Item
• The chromatic index of graphs with large maximum degree
• Two conjectures on edge-colouring
• NP-completeness of edge-colouring some restricted graphs
• On the compatibility between a graph and a simple order
• The chromatic index of graphs with a spanning star
• The NP-Completeness of Edge-Coloring
• Odd Minimum Cut-Sets and b-Matchings
• The chromatic index of complete multipartite graphs

This page was built for publication: On edge-colouring indifference graphs