The flower conjecture in special classes of graphs

DOI10.7151/DMGT.1015MaRDI QIDQ4882590zbMATH OpenOpenAlexWikidataFDO

Authors 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

centerclaw-free graphseulerian subgraphflowerflower propertyhamiltonian graphssquares

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Some polynomials of flower graphs
• On family of cubic graphs containing flower snarks
• A note on spanning Eulerian graphs.
• Generalized flowers in \(k\)-connected graphs. II
• Hamilton cycles in claw-free graphs

Cited in

(13)

• On edge irregular reflexive labellings for the generalized friendship graphs
• On the independent domination polynomial of a graph
• A sum labelling for the generalised friendship graph
• Grothendieck ring class of banana and flower graphs
• THE ECCENTRIC DIGRAPH OF A GENERALIZED FLOWER GRAPH
• TOTAL DOMINATION POLYNOMIAL OF GRAPHS FROM PRIMARY SUBGRAPHS
• THE TRAPPING PROBLEM OF WEIGHTED (2,2)-FLOWER NETWORKS WITH THE SAME WEIGHT SEQUENCE
• Vertex neighborhood restricted edge achromatic sums of graphs
• Edge incident 2-edge coloring of graphs
• More on total domination polynomial and \(\mathcal{D}_t\)-equivalence classes of some graphs
• On the vertex irregular reflexive labeling of generalized friendship graph and corona product of graphs
• On the roots of independent domination polynomials of graphs
• Tutte polynomials of flower graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4882590)