scientific article

zbMath0455.05044MaRDI QIDQ3903036

Ladislav Nebeský

Publication date: 1980

Full work available at URL: https://eudml.org/doc/32061

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

square of a graphhamiltonian-connectedcomplementary graphs

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• A necessary condition for the square of a graph to be Hamiltonian
• The square of a block is vertex pancyclic
• 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
• The square of every two-connected graph is Hamiltonian
• On pancyclic line graphs

This page was built for publication: