scientific article; zbMATH DE number 3712003

MaRDI QIDQ3903036zbMATH OpenFDO

Authors Ladislav Nebeský

Publication date 1980

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

zbMATH Keywords

square of a graphhamiltonian-connectedcomplementary graphs

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Cites work

• scientific article; zbMATH DE number 3312524 (Why is no real title available?)
• scientific article; zbMATH DE number 3377257 (Why is no real title available?)
• A necessary condition for the square of a graph to be Hamiltonian
• In the square of graphs, Hamiltonicity and pancyclicity, Hamiltonian connectedness and panconnectedness are equivalent concepts
• On pancyclic line graphs
• The square of a block is Hamiltonian connected
• The square of a block is strongly path connected
• The square of a block is vertex pancyclic
• The square of every two-connected graph is Hamiltonian

This page was built for publication:

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