A condition on Hamilton-connected line graphs

DOI10.1007/S40840-021-01232-6MaRDI QIDQ2117573zbMATH OpenOpenAlexFDO

Authors Lan Lei, Jia Wei, Yikang Xie, Mingquan Zhan, Hong-Jian Lai

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

zbMATH Keywords

matchingminimum degreeHamilton-connected graphessential edge connectivity1-Hamiltonian graphChvátal-Erdős condition

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Structural characterization of families of graphs (05C75) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• On \(s\)-Hamiltonian-connected line graphs
• Degree sum and Hamiltonian-connected line graphs
• Hamiltonian connectedness in 3-connected line graphs
• scientific article; zbMATH DE number 1146067
• scientific article; zbMATH DE number 4152426

Cites work

• scientific article; zbMATH DE number 4055653 (Why is no real title available?)
• scientific article; zbMATH DE number 6890310 (Why is no real title available?)
• scientific article; zbMATH DE number 867689 (Why is no real title available?)
• A note on Hamiltonian circuits
• A reduction method to find spanning Eulerian subgraphs
• Advances on the Hamiltonian problem -- a survey
• Catlin's reduced graphs with small orders
• Chvátal-Erdős conditions and almost spanning trails
• Chvátal–Erdős Theorem: Old Theorem with New Aspects
• Edge-connectivity and edge-disjoint spanning trees
• Eulerian subgraphs and Hamilton-connected line graphs
• Graph theory
• Hamiltonian connectedness in 3-connected line graphs
• Hamiltonian results inK1,3-free graphs
• Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
• On 1-Hamilton-connected claw-free graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs
• On \(s\)-Hamiltonian line graphs
• On \(s\)-Hamiltonicity of net-free line graphs
• On a closure concept in claw-free graphs
• On some intriguing problems in Hamiltonian graph theory---a survey
• Recent advances on the Hamiltonian problem: survey III
• Reflections on graph theory
• Spanning trails containing given edges
• Supereulerian graphs and matchings
• Supereulerian graphs with constraints on the matching number and minimum degree
• Supereulerian graphs with small matching number and 2-connected Hamiltonian claw-free graphs
• TWO THEOREMS IN GRAPH THEORY
• The Chvàtal-Erdős condition for supereulerian graphs and the Hamiltonian index
• The Chvátal-Erdős condition for a graph to have a spanning trail

Cited in

(12)

• Hamiltonian line graphs with local degree conditions
• 3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian
• Hamiltonian (s, t)-paths in solid supergrid graphs
• Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs
• scientific article; zbMATH DE number 731856 (Why is no real title available?)
• The Hamiltonicity and Hamiltonian-connectivity of solid supergrid graphs
• Eulerian subgraphs containing given vertices and hamiltonian line graphs
• scientific article; zbMATH DE number 4152426 (Why is no real title available?)
• Hamiltonian paths in spanning subgraphs of line graphs
• Hamiltonian connectedness in 3-connected line graphs
• Contractions and hamiltonian line graphs
• The spanning connectivity of 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)