Longest cycles in 4-connected graphs (Q2404386): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disc.2017.07.020 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2749817020 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An improvement of fraisse's sufficient condition for hamiltonian graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5422499 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Cycles through particular subgraphs of claw‐free graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Hamiltonism, degree sum and neighborhood intersections / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Cyclable sets of vertices in 3-connected graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Longest cycles in 3-connected graphs / rank | |||
Normal rank | |||
Latest revision as of 09:39, 14 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Longest cycles in 4-connected graphs |
scientific article |
Statements
Longest cycles in 4-connected graphs (English)
0 references
18 September 2017
0 references
circumference
0 references
non-insertible vertex
0 references
independent set
0 references
