The square of a block is strongly path connected

DOI10.1016/0095-8956(76)90065-4zbMATH Open0284.05116OpenAlexW2045633145MaRDI QIDQ1844686FDOQ1844686

Authors: Ralph Faudree, R. H. Schelp 

Publication date: 1976

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(76)90065-4

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cites Work

• Title not available (Why is that?)
• The square of a block is vertex pancyclic
• Minimally 2-connected graphs.
• On spanning subgraphs of a connected bridgeless graph and their application to DT-graphs
• The square of every two-connected graph is Hamiltonian
• The square of a block is Hamiltonian connected
• A necessary condition for the square of a graph to be Hamiltonian

Cited In (8)

• On graphs whose square have strong Hamiltonian properties
• Graphs with cyclomatic number two having panconnected square
• Completely strong path-connected tournaments
• Title not available (Why is that?)
• Some recent results in hamiltonian graphs
• Spanning connectivity of the power of a graph and Hamilton-connected index of a graph
• Connected even factors in the square of essentially 2-edge-connected graph
• Graphs with cyclomatic number three having panconnected square

This page was built for publication: The square of a block is strongly path connected

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