The chromatic index of proper circular-arc graphs of odd maximum degree which are chordal

DOI10.1016/J.ENTCS.2019.08.012MaRDI QIDQ2132339zbMATH OpenOpenAlexWikidataFDO

Authors João Pedro W. Bernardi, Murilo V. G. da Silva, Leandro M. Zatesko, André L. P. Guedes

Publication date 27 April 2022

Full work available at URL https://doi.org/10.1016/j.entcs.2019.08.012

zbMATH Keywords

chordalchromatic indexcircular-arcedge-coloringpullback

Mathematics Subject Classification ID

Graph theory (05Cxx) Mathematical programming (90Cxx)

Recommendations

• Chromatic index of graphs with no cycle with a unique chord
• Chromatic index determined by fractional chromatic index
• The circular chromatic index
• Chromatic index, treewidth and maximum degree
• Chromatic index, treewidth and maximum degree

Cites work

• Decompositions for edge-coloring join graphs and cobipartite graphs
• scientific article; zbMATH DE number 3307330 (Why is no real title available?)
• Matrix characterizations of circular-arc graphs
• On edge-colouring indifference graphs
• The Complexity of Coloring Circular Arcs and Chords
• The NP-completeness column: an ongoing guide
• The NP-Completeness of Edge-Coloring
• Total-chromatic number and chromatic index of dually chordal graphs

Cited in

(2)

• Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree
• Circular chromatic index of graphs of maximum degree 3

This page was built for publication: The chromatic index of proper circular-arc graphs of odd maximum degree which are chordal

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