A new proof of the theorem by Fleischner (Q1179471): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0095-8956(91)90098-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2137573762 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On spanning subgraphs of a connected bridgeless graph and their application to DT-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The square of every two-connected graph is Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: In the square of graphs, Hamiltonicity and pancyclicity, Hamiltonian connectedness and panconnectedness are equivalent concepts / rank
 
Normal rank
Property / cites work
 
Property / cites work: The square of a block is Hamiltonian connected / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian Paths in Squares of Infinite Locally Finite Blocks / rank
 
Normal rank

Latest revision as of 13:47, 15 May 2024

scientific article
Language Label Description Also known as
English
A new proof of the theorem by Fleischner
scientific article

    Statements

    A new proof of the theorem by Fleischner (English)
    0 references
    0 references
    26 June 1992
    0 references
    \textit{H. Fleischner} [J. Comb. Theory, Ser. B. 6, 17-28 (1974; Zbl 0256.05120)] proved that the square of every two-connected graph includes a Hamiltonian circuit. Here the author gives a new proof of this theorem.
    0 references
    0 references
    theorem by Fleischner
    0 references
    two-connected graph
    0 references
    Hamiltonian circuit
    0 references

    Identifiers