On the conformability of regular line graphs

DOI10.1051/RO/2023140MaRDI QIDQ6181221zbMATH OpenFDO

Authors Luerbio Faria, Mauro Nigro, Diana Sasaki

Publication date 22 January 2024

Published in RAIRO - Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

total coloringvertex coloringconformable coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• A note on total chromatic numbers of graphs
• Non-conformable subgraphs of non-conformable graphs
• The overfull conjecture and the conformability conjecture
• Results about the total chromatic number and the conformability of some families of circulant graphs
• Total chromatic number of regular graphs of odd order and high degree

Cites work

• scientific article; zbMATH DE number 4108788 (Why is no real title available?)
• A result on the total colouring of powers of cycles
• Characterizations of derived graphs
• Compositions, decompositions, and conformability for total coloring on power of cycle graphs
• Determining the total colouring number is NP-hard
• How to find overfull subgraphs in graphs with large maximum degree
• On the total coloring of certain graphs
• Total coloring conjecture for certain classes of graphs
• Total coloring of quasi-line graphs and inflated graphs

Cited in

(1)

• A polynomial-time algorithm for conformable coloring on regular bipartite and subcubic graphs

This page was built for publication: On the conformability of regular line graphs

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