A condition on Hamilton-connected line graphs
type: Item
instance of: scholarly article
title: A condition on Hamilton-connected line graphs
zbMATH Open document ID: 1485.05096
author: Lan Lei
author: Jia Wei
author: Yikang Xie
author: Mingquan Zhan
author: Hong-Jian Lai
published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series
publication date: 2022-03-21T00:00:00Z
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 05C76
zbMATH DE Number: 7493942
zbMATH Keywords: Chvátal-Erdős condition
zbMATH Keywords: Hamilton-connected graph
zbMATH Keywords: essential edge connectivity
zbMATH Keywords: matching
zbMATH Keywords: minimum degree
zbMATH Keywords: 1-Hamiltonian graph
MaRDI profile type: Publication
full work available at URL: s40840-021-01232-6
OpenAlex ID: W4205152167
cites work: Supereulerian graphs with constraints on the matching number and minimum degree
cites work: TWO THEOREMS IN GRAPH THEORY
cites work: Q5422499
cites work: On some intriguing problems in Hamiltonian graph theory---a survey
cites work: Q3791179
cites work: A reduction method to find spanning Eulerian subgraphs
cites work: Q4873803
cites work: Edge-connectivity and edge-disjoint spanning trees
cites work: A note on Hamiltonian circuits
cites work: The Chvàtal-Erdős condition for supereulerian graphs and the Hamiltonian index
cites work: On Eulerian and Hamiltonian Graphs and Line Graphs
cites work: Advances on the Hamiltonian problem -- a survey
cites work: Recent advances on the Hamiltonian problem: survey III
cites work: On 1-Hamilton-connected claw-free graphs
cites work: Hamiltonian connectedness in 3-connected line graphs
cites work: On \(s\)-Hamiltonian line graphs
cites work: Catlin’s reduced graphs with small orders
cites work: Supereulerian graphs and matchings
cites work: Chvátal-Erdős conditions and almost spanning trails
cites work: Eulerian subgraphs and Hamilton-connected line graphs
cites work: Q4568152
cites work: Spanning trails containing given edges
cites work: On \(s\)-Hamiltonicity of net-free line graphs
cites work: Hamiltonian results inK1,3-free graphs
cites work: On a closure concept in claw-free graphs
cites work: Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
cites work: Chvátal–Erdős Theorem: Old Theorem with New Aspects
cites work: The Chvátal-Erdős condition for a graph to have a spanning trail
cites work: Reflections on graph theory
cites work: Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs
DOI: 10.1007/S40840-021-01232-6
description: scientific article; zbMATH DE number 7493942