Forbidden structures for planar perfect consecutively colourable graphs

DOI10.7151/dmgt.1958zbMath1359.05034OpenAlexW2587557760MaRDI QIDQ521749

Marta Borowiecka-Olszewska, Ewa Drgas-Burchardt

Publication date: 12 April 2017

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1958

zbMATH Keywords

edge colouringdeficiencyconsecutive colouringforbidden graphinterval colouringSevastjanov graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Interval colorings of graphs—Coordinated and unstable no‐wait schedules ⋮ Consecutive colouring of oriented graphs ⋮ Cyclic deficiency of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The deficiency of all generalized Hertz graphs and minimal consecutively non-colourable graphs in this class
• Compact scheduling of zero-one time operations in multi-stage systems
• On interval edge colorings of \((\alpha ,\beta )\)-biregular bipartite graphs
• On the structure and deficiency of \(k\)-trees with bounded degree
• Interval edge-colorings of complete graphs and \(n\)-dimensional cubes
• On the deficiency of bipartite graphs
• Investigation on interval edge-colorings of graphs
• Interval edge-colorings of Cartesian products of graphs I
• Interval edge colorings of some products of graphs
• Interval coloring of (3,4)-biregular bipartite graphs having large cubic subgraphs
• Graph Colorings
• Interval Non‐edge‐Colorable Bipartite Graphs and Multigraphs

This page was built for publication: Forbidden structures for planar perfect consecutively colourable graphs