A note on interval colourings of graphs

DOI10.1016/J.EJC.2024.103956zbMATH Open1543.05047MaRDI QIDQ6568831

António Girão, Youri Tamitegama, Maria Axenovich, Lawrence Hollom, Leo Versteegen, Emil Powierski, Author name not available (Why is that?), Julien Portier

Publication date: 8 July 2024

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

interval coloringedge-decompositionconsecutive colouringforbidden graphperfect consecutively colourable graphno-wait schedule

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the thickness and arboricity of a graph
• Investigation on interval edge-colorings of graphs
• Consecutive colouring of oriented graphs
• Note on regular subgraphs
• Interval colorings of edges of a multigraph
• Consecutive colorings of the edges of general graphs
• Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules
• Interval colorings of graphs—Coordinated and unstable no‐wait schedules

Related Items (2)

Interval colourable orientations of graphs ⋮ On interval colouring reorientation number of oriented graphs

This page was built for publication: A note on interval colourings of graphs

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