Longest cycles in 3-connected graphs with given independence number (Q1043819): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A note on Hamiltonian circuits / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3686747 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Cycles in graphs with prescribed stability number and connectivity / rank | |||
Normal rank | |||
Revision as of 06:20, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Longest cycles in 3-connected graphs with given independence number |
scientific article |
Statements
Longest cycles in 3-connected graphs with given independence number (English)
0 references
9 December 2009
0 references
longest cycles
0 references
3-connected graphs
0 references
independence number
0 references
