Polyhedral graphs without Hamiltonian cycles (Q1373169): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q5577694 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pairs of edge-disjoint Hamiltonian circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortness exponents of families of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest cycles in generalized Buckminsterfullerene graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclically 5-edge-connected cubic planar graphs and shortness coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hamiltonian Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über das Problem der Existenz von HAMILTONkreisen in planaren, regulären Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortness coefficient of cyclically 5-connected cubic planar graphs / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2018978975 / rank
 
Normal rank

Latest revision as of 10:13, 30 July 2024

scientific article
Language Label Description Also known as
English
Polyhedral graphs without Hamiltonian cycles
scientific article

    Statements

    Identifiers