LACEABILITY PROPERTIES IN FLOWER SNARK GRAPHS

DOI10.17654/DM022010055zbMath1495.05163OpenAlexW2975598208MaRDI QIDQ5036157

A. Girisha, M. R. Sumitra Devi, Shashidhar Shekhar Neelannavar, Ramya R.

Publication date: 23 February 2022

Published in: Advances and Applications in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.17654/dm022010055

zbMATH Keywords

hypo-Hamiltonian graph\(K^{+r}\)-hypoedge-Hamiltonian graphHamiltonian-\(t^\ast\)-laceable graph

Mathematics Subject Classification ID

Graph theory (05C99) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• On classes of regular graphs with constant metric dimension
• Special classes of snarks
• On a class of Hamiltonian laceable 3-regular graphs
• Laceability and distance graphs
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• On hypohamiltonian snarks and a theorem of Fiorini

This page was built for publication: LACEABILITY PROPERTIES IN FLOWER SNARK GRAPHS