The flower conjecture in special classes of graphs

DOI10.7151/DMGT.1015zbMATH Open0845.05065OpenAlexW2008112379WikidataQ123267537 ScholiaQ123267537MaRDI QIDQ4882590FDOQ4882590

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

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

zbMATH Keywords

centerclaw-free graphssquareshamiltonian graphsflowereulerian subgraphflower property

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Cited In (9)

• THE TRAPPING PROBLEM OF WEIGHTED (2,2)-FLOWER NETWORKS WITH THE SAME WEIGHT SEQUENCE
• On the independent domination polynomial of a graph
• Tutte polynomials of flower graphs
• Grothendieck ring class of banana and flower graphs
• On edge irregular reflexive labellings for the generalized friendship graphs
• Vertex neighborhood restricted edge achromatic sums of graphs
• A sum labelling for the generalised friendship graph
• THE ECCENTRIC DIGRAPH OF A GENERALIZED FLOWER GRAPH
• TOTAL DOMINATION POLYNOMIAL OF GRAPHS FROM PRIMARY SUBGRAPHS

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)