On the extended Clark-Wormold Hamiltonian-like index problem
From MaRDI portal
Publication:2075501
DOI10.1016/j.disc.2021.112745zbMath1482.05183OpenAlexW4200085543WikidataQ114190568 ScholiaQ114190568MaRDI QIDQ2075501
Lan Lei, Mingquan Zhan, Wei Xiong, Hong-Jian Lai, Yikang Xie
Publication date: 14 February 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2021.112745
edge-connectivityspanning tree packingHamiltonian line graphHamiltonian indexHamilton-connected line graph
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On 1-Hamilton-connected claw-free graphs
- Hamilton cycles in 5-connected line graphs
- Panconnected index of graphs
- Hamiltonian index is NP-complete
- Characterization of removable elements with respect to having \(k\) disjoint bases in a matroid
- On hamiltonian line graphs and connectivity
- The \(s\)-Hamiltonian index
- The Hamiltonian index of graphs
- Hamiltonian connectedness in 3-connected line graphs
- Hamilton-connected indices of graphs
- On the Hamiltonian index
- On line graphs and the Hamiltonian index
- On the hamiltonian index of a graph
- A simple upper bound for the hamiltonian index of a graph
- Degree sum and Hamiltonian-connected line graphs
- Eulerian subgraphs and Hamilton-connected line graphs
- Essential edge connectivity of line graphs
- Connectivity and edge-disjoint spanning trees
- Bounds of the number of disjoint spanning trees
- All 4-connected line graphs of claw free graphs are Hamiltonian connected
- Chvátal-Erdős conditions and almost spanning trails
- Spanning 3-connected index of graphs
- A reduction method to find spanning Eulerian subgraphs
- Reflections on graph theory
- On Eulerian and Hamiltonian Graphs and Line Graphs
