Graphs with cyclomatic number three having panconnected square

DOI10.1142/S1793830917500677zbMath1386.05100OpenAlexW2757558283MaRDI QIDQ4595257

Sirirat Singhun, W. Hemakul, Gek Ling Chia

Publication date: 29 November 2017

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

Full work available at URL: https://doi.org/10.1142/s1793830917500677

zbMATH Keywords

Hamilton pathcyclomatic numbersquare of graphpanconnected graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Graphs with cyclomatic number three having panconnected square, II

Cites Work

• Unnamed Item
• Graphs with cyclomatic number two having panconnected square
• On graphs whose square have strong Hamiltonian properties
• In the square of graphs, Hamiltonicity and pancyclicity, Hamiltonian connectedness and panconnectedness are equivalent concepts
• The square of a block is Hamiltonian connected
• The square of a block is strongly path connected
• Trees with Hamiltonian square

This page was built for publication: Graphs with cyclomatic number three having panconnected square