Every longest circuit of a 3‐connected,<i>K</i><sub>3,3</sub>‐minor free graph has a chord (Q3630835)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5562007
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Every longest circuit of a 3‐connected,<i>K</i><sub>3,3</sub>‐minor free graph has a chord |
scientific article; zbMATH DE number 5562007 |
Statements
Every longest circuit of a 3‐connected,<i>K</i><sub>3,3</sub>‐minor free graph has a chord (English)
0 references
4 June 2009
0 references
longest circuit
0 references
3-connected
0 references
minor free graphs
0 references
0.8946762
0 references
0.8422557
0 references
0.84086186
0 references
0.8386698
0 references
0.8373111
0 references
0.8332665
0 references
