Non-proper edge-colouring of graphs and hereditary graph properties

DOI10.2989/16073606.2017.1302516zbMath1423.05062OpenAlexW2605718691MaRDI QIDQ5236091

Jon Smit, Samantha Dorfling, Tomáš Vetrík, Elizabeth C. M. Maritz

Publication date: 15 October 2019

Published in: Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2989/16073606.2017.1302516

zbMATH Keywords

edge-colouringmaximum degreehereditary graph propertynon-proper colouring

Mathematics Subject Classification ID

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

Cites Work

• Distant irregularity strength of graphs
• The Ramsey numbers for disjoint unions of trees
• The Ramsey number for theta graph versus a clique of order three and four
• The Ramsey numbers of large cycles versus odd wheels
• Ramsey numbers for cycles in graphs
• The decomposability of additive hereditary properties of graphs
• Edge-colouring of graphs and hereditary graph properties
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Non-proper edge-colouring of graphs and hereditary graph properties