Every longest circuit of a 3‐connected,<i>K</i><sub>3,3</sub>‐minor free graph has a chord (Q3630835): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3097395 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Chords of longest circuits in locally planar graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Chords of longest circuits in 3-connected graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Chords of longest circuits of graphs embedded in torus and Klein bottle / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Chords of longest cycles in cubic graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Longest cycles and their chords / rank | |||
Normal rank | |||
Latest revision as of 14:41, 1 July 2024
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
