The flower conjecture in special classes of graphs

DOI10.7151/dmgt.1015zbMath0845.05065OpenAlexW2008112379WikidataQ123267537 ScholiaQ123267537MaRDI QIDQ4882590

Zdeněk Ryjáček, Ingo Schiermeyer

Publication date: 2 September 1996

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

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

zbMATH Keywords

centersquaresclaw-free graphshamiltonian graphsflowereulerian subgraphflower property

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (5)

TOTAL DOMINATION POLYNOMIAL OF GRAPHS FROM PRIMARY SUBGRAPHS ⋮ On edge irregular reflexive labellings for the generalized friendship graphs ⋮ Vertex neighborhood restricted edge achromatic sums of graphs ⋮ On the independent domination polynomial of a graph ⋮ A sum labelling for the generalised friendship graph

This page was built for publication: The flower conjecture in special classes of graphs