A nine point theorem for 3-connected graphs (Q1165867): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Cubic identity graphs and planar graphs derived from trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Cycles through specified vertices of a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3097395 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Flip-Flops in Hypohamiltonian Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Regular \(n\)-valent \(n\)-connected non-Hamiltonian non \(n\)-edge-colourable graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Cycles and Connectivity in Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Circuits containing specified edges / rank | |||
Normal rank |
Latest revision as of 15:06, 13 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A nine point theorem for 3-connected graphs |
scientific article |
Statements
A nine point theorem for 3-connected graphs (English)
0 references
1982
0 references
regular graphs
0 references
cycle
0 references
connected cubic graph
0 references