A condition on Hamilton-connected line graphs
DOI10.1007/S40840-021-01232-6zbMATH Open1485.05096OpenAlexW4205152167MaRDI QIDQ2117573FDOQ2117573
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
Recommendations
matchingminimum degreeHamilton-connected graph[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Chv%EF%BF%BD%EF%BF%BDtal-Erd%EF%BF%BD%EF%BF%BDs+condition&go=Go Chv��tal-Erd��s condition]essential edge connectivity1-Hamiltonian graph
Eulerian and Hamiltonian graphs (05C45) Structural characterization of families of graphs (05C75) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Graph theory
- On a closure concept in claw-free graphs
- A reduction method to find spanning Eulerian subgraphs
- On Eulerian and Hamiltonian Graphs and Line Graphs
- A note on Hamiltonian circuits
- TWO THEOREMS IN GRAPH THEORY
- Hamiltonian results inK1,3-free graphs
- Eulerian subgraphs and Hamilton-connected line graphs
- Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
- Edge-connectivity and edge-disjoint spanning trees
- Hamiltonian connectedness in 3-connected line graphs
- Reflections on graph theory
- On some intriguing problems in Hamiltonian graph theory---a survey
- Recent advances on the Hamiltonian problem: survey III
- Advances on the Hamiltonian problem -- a survey
- Supereulerian graphs with constraints on the matching number and minimum degree
- Supereulerian graphs and matchings
- On 1-Hamilton-connected claw-free graphs
- Title not available (Why is that?)
- Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs
- The Chvátal-Erdős condition for a graph to have a spanning trail
- The Chvàtal-Erdős condition for supereulerian graphs and the Hamiltonian index
- Spanning trails containing given edges
- On \(s\)-Hamiltonicity of net-free line graphs
- On \(s\)-Hamiltonian line graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Chvátal–Erdős Theorem: Old Theorem with New Aspects
- Chvátal-Erdős conditions and almost spanning trails
- Catlin’s reduced graphs with small orders
Cited In (9)
- Title not available (Why is that?)
- Hamiltonian line graphs with local degree conditions
- The Hamiltonicity and Hamiltonian-connectivity of solid supergrid graphs
- Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs
- 3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian
- Hamiltonian (s, t)-paths in solid supergrid graphs
- Title not available (Why is that?)
- Contractions and hamiltonian line graphs
- Eulerian subgraphs containing given vertices and hamiltonian line graphs
This page was built for publication: A condition on Hamilton-connected line graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117573)
