A condition on Hamilton-connected line graphs
From MaRDI portal
Publication:2117573
DOI10.1007/s40840-021-01232-6zbMath1485.05096OpenAlexW4205152167MaRDI QIDQ2117573
Mingquan Zhan, Hong-Jian Lai, Yikang Xie, Jia Wei, Lan Lei
Publication date: 21 March 2022
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40840-021-01232-6
matchingminimum degreeHamilton-connected graphChvátal-Erdős conditionessential edge connectivity1-Hamiltonian graph
Structural characterization of families of graphs (05C75) Eulerian and Hamiltonian graphs (05C45) Graph operations (line graphs, products, etc.) (05C76)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On 1-Hamilton-connected claw-free graphs
- The Chvátal-Erdős condition for a graph to have a spanning trail
- Supereulerian graphs and matchings
- Spanning trails containing given edges
- The Chvàtal-Erdős condition for supereulerian graphs and the Hamiltonian index
- Edge-connectivity and edge-disjoint spanning trees
- Hamiltonian connectedness in 3-connected line graphs
- On a closure concept in claw-free graphs
- Advances on the Hamiltonian problem -- a survey
- On some intriguing problems in Hamiltonian graph theory---a survey
- Eulerian subgraphs and Hamilton-connected line graphs
- Chvátal-Erdős conditions and almost spanning trails
- On \(s\)-Hamiltonicity of net-free line graphs
- Recent advances on the Hamiltonian problem: survey III
- A note on Hamiltonian circuits
- Supereulerian graphs with constraints on the matching number and minimum degree
- Ons-Hamiltonian Line Graphs
- Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs
- Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
- TWO THEOREMS IN GRAPH THEORY
- Hamiltonian results inK1,3-free graphs
- A reduction method to find spanning Eulerian subgraphs
- Reflections on graph theory
- Catlin’s reduced graphs with small orders
- Chvátal–Erdős Theorem: Old Theorem with New Aspects
- On Eulerian and Hamiltonian Graphs and Line Graphs
This page was built for publication: A condition on Hamilton-connected line graphs
