Polyhedral graphs without Hamiltonian cycles (Q1373169): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
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 |
Revision as of 19:10, 27 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Polyhedral graphs without Hamiltonian cycles |
scientific article |
Statements
Polyhedral graphs without Hamiltonian cycles (English)
0 references
16 March 1998
0 references
polyhedral cyclically \(k\)-connected graphs
0 references
circumference
0 references
Hamiltonian cycle
0 references
faces
0 references