A simple upper bound for the hamiltonian index of a graph (Q1339866): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Characterizations of derived graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A reduction method to find spanning Eulerian subgraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hamilton cycles and closed trails in iterated line graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Hamiltonian Line-Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Eulerian and Hamiltonian Graphs and Line Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the hamiltonian index of a graph / rank | |||
Normal rank |
Latest revision as of 10:54, 23 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A simple upper bound for the hamiltonian index of a graph |
scientific article |
Statements
A simple upper bound for the hamiltonian index of a graph (English)
0 references
16 January 1995
0 references
The main result of this paper states that if \(G\) is a connected graph on \(n\) vertices, with the maximum degree \(\Delta\) and distinct from a path, then the \(n-\Delta\) iterated line graph of \(G\) is hamiltonian.
0 references
upper bound
0 references
hamiltonian index
0 references
hamiltonian cycles
0 references
line graph
0 references