A fan-type result on \(k\)-ordered graphs (Q765506): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5475533 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: New sufficient conditions for cycles in graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Survey of results on \(k\)-ordered graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Degree conditions for <i>k</i>‐ordered hamiltonian graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Sufficient Degree Conditions for a Graph to be $k$-linked / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Degree conditions on distance 2 vertices that imply \(k\)-ordered Hamiltonian / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An improved linear edge bound for graph linkages / rank | |||
Normal rank | |||
Latest revision as of 00:54, 5 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fan-type result on \(k\)-ordered graphs |
scientific article |
Statements
A fan-type result on \(k\)-ordered graphs (English)
0 references
19 March 2012
0 references
\(k\)-ordered graphs
0 references
\(k\)-ordered hamiltonian
0 references
\(k\)-linked
0 references
combinatorial problems
0 references
degree sum condition
0 references
