Colouring the petals of a graph
type: Item
instance of: scholarly article
title: Colouring the petals of a graph
zbMATH Open document ID: 1011.05022
author: D. Cariolaro
author: Gianfranco Cariolaro
published in: The Electronic Journal of Combinatorics
publication date: 2003-05-07T00:00:00Z
full work available at URL: https://eudml.org/doc/122601
full work available at URL: v10i1r6.html
review text: Summary: A petal graph is a connected graph with maximum degree three, minimum degree two, and such that the set of vertices of degree three induces a 2-regular graph and the set of vertices of degree two induces an empty graph. We prove here that, with the single exception of the graph obtained from the Petersen graph by deleting one vertex, all petal graphs are Class 1. This settles a particular case of a conjecture of Hilton and Zhao.
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 1907091
MaRDI profile type: Publication
Recommended article: Q3708830
Recommended article: Coloring drawings of graphs
Recommended article: The coloring of graphs
Recommended article: Colorful graph coloring
Recommended article: Q4635974
Recommended article: Q3165619
Recommended article: Graph colouring and variations
Recommended article: Note on graphs colouring
Recommended article: Q3134657
Recommended article: Graph colouring variations
description: scientific article; zbMATH DE number 1907091