scientific article; zbMATH DE number 3712003

zbMATH Open0455.05044MaRDI QIDQ3903036FDOQ3903036

Authors: Ladislav Nebeský 

Publication date: 1980

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

Title of this publication is not available (Why is that?)

zbMATH Keywords

square of a graphhamiltonian-connectedcomplementary graphs

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Cites Work

• The square of a block is vertex pancyclic
• The square of every two-connected graph is Hamiltonian
• 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
• Title not available (Why is that?)
• A necessary condition for the square of a graph to be Hamiltonian
• On pancyclic line graphs
• Title not available (Why is that?)

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)