On n-hamiltonian line graphs
From MaRDI portal
Publication:1217716
DOI10.1016/0095-8956(77)90071-5zbMath0307.05122MaRDI QIDQ1217716
Publication date: 1977
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(77)90071-5
05C35: Extremal problems in graph theory
Related Items
An \(s\)-Hamiltonian line graph problem, Edge-connectivity and edge-disjoint spanning trees, Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
Cites Work