Colouring the petals of a graph

zbMath1011.05022MaRDI QIDQ1871369

Gianfranco Cariolaro, David Cariolaro

Publication date: 7 May 2003

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/122601

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (10)

Edge-colouring graphs with bounded local degree sums ⋮ The core conjecture of Hilton and Zhao ⋮ Some criteria for a graph to be class 1 ⋮ Graph edge coloring: a survey ⋮ Chromatic index of graphs with no cycle with a unique chord ⋮ Clique-perfectness of complements of line graphs ⋮ The chromatic index of a graph whose core is a cycle of order at most 13 ⋮ Clique-perfectness of complements of line graphs ⋮ The Hilton--Zhao Conjecture is True for Graphs with Maximum Degree 4 ⋮ The chromatic index of a claw-free graph whose core has maximum degree 2

This page was built for publication: Colouring the petals of a graph