The entire graph of a bridgeless connected plane graph is Hamiltonian (Q1232422): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

Latest revision as of 20: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