An \(s\)-Hamiltonian line graph problem (Q995763): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3097395 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: 3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian / 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: Supereulerian graphs: A survey / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graphs without spanning closed trails / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Spanning closed trails in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2715961 / 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 n-hamiltonian line graphs / rank | |||
Normal rank |
Latest revision as of 15:09, 26 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An \(s\)-Hamiltonian line graph problem |
scientific article |
Statements
An \(s\)-Hamiltonian line graph problem (English)
0 references
10 September 2007
0 references