Every longest circuit of a 3‐connected,<i>K</i><sub>3,3</sub>‐minor free graph has a chord (Q3630835)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Every longest circuit of a 3‐connected,<i>K</i><sub>3,3</sub>‐minor free graph has a chord |
scientific article |
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
