All 4-connected line graphs of claw free graphs are Hamiltonian connected
type: Item
instance of: scholarly article
title: All 4-connected line graphs of claw free graphs are Hamiltonian connected
zbMATH Open document ID: 1027.05059
author: Matthias Kriesell
published in: Journal of Combinatorial Theory. Series B
publication date: 2002-12-10T00:00:00Z
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 1843775
zbMATH Keywords: Eulerian graph
MaRDI profile type: Publication
full work available at URL: jctb.2001.2040
OpenAlex ID: W2022750713
cites work: Q5422499
cites work: On factors of 4-connected claw-free graphs
cites work: Q4342632
cites work: Flows and generalized coloring theorems in graphs
cites work: On \(k\)-critical connected line graphs
cites work: Every 4-connected line graph of a planar graph is Hamiltonian
cites work: Q3220626
cites work: Hamiltonian results inK1,3-free graphs
cites work: Edge-Disjoint Spanning Trees of Finite Graphs
cites work: The interchange graph of a finite graph
cites work: On a closure concept in claw-free graphs
cites work: Cycles through four edges in 3-connected cubic graphs
cites work: Reflections on graph theory
cites work: On the Problem of Decomposing a Graph into n Connected Factors
cites work: Q3751608
cites work: On hamiltonian line graphs and connectivity
DOI: 10.1006/JCTB.2001.2040
description: scientific article; zbMATH DE number 1843775