The entire graph of a bridgeless connected plane graph is Hamiltonian (Q1232422): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4041607 / 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: The square of every two-connected graph is Hamiltonian / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Parallel concepts in graph theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The square of a block is vertex pancyclic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5659558 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A correction to: On the algebraic theory of graph colorings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimally 2-connected graphs. / rank | |||
Normal rank |
Latest revision as of 19:15, 12 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The entire graph of a bridgeless connected plane graph is Hamiltonian |
scientific article |
Statements
The entire graph of a bridgeless connected plane graph is Hamiltonian (English)
0 references
1976
0 references