Chordality and 2-factors in tough graphs
type: Item
instance of: scholarly article
title: Chordality and 2-factors in tough graphs
zbMATH Open document ID: 0937.68094
DOI: 10.1016/S0166-218X(99)00142-0
author: D. Bauer
author: Gyula Y. Katona
author: Dieter Kratsch
author: Henk Jan Veldman
published in: Discrete Applied Mathematics
publication date: 2000-01-30T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 1395020
zbMATH Keywords: chordal graphs
MaRDI profile type: Publication
cites work: Not every 2-tough graph is Hamiltonian
cites work: Toughness, minimum degree, and the existence of 2‐factors
cites work: Q4873795
cites work: Q4871126
cites work: Reguläre Faktoren von Graphen.
cites work: Q4350166
cites work: Q4378526
cites work: Tough graphs and Hamiltonian circuits.
cites work: Toughness and the existence ofk-factors
cites work: Toughness, hamiltonicity and split graphs
cites work: The Factors of Graphs
full work available at URL: s0166-218x(99)00142-0
OpenAlex ID: W2113050592
Wikidata QID: Q127679068
description: scientific article; zbMATH DE number 1395020