An \(s\)-Hamiltonian line graph problem (Q995763): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Wai Chee Shiu / rank
Normal rank
 
Property / author
 
Property / author: Deying Li / rank
Normal rank
 
Property / author
 
Property / author: Wai Chee Shiu / rank
 
Normal rank
Property / author
 
Property / author: Deying Li / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00373-007-0727-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2036580076 / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

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