Forbidden subgraphs for existences of (connected) 2-factors of a graph
type: Item
instance of: scholarly article
title: Forbidden subgraphs for existences of (connected) 2-factors of a graph
zbMATH Open document ID: 1505.05101
author: Xiaojing Yang
author: Liming Xiong
publication date: 2022-12-02T00:00:00Z
Mathematics Subject Classification ID: 05C60
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 7626212
zbMATH Keywords: forbidden subgraph
zbMATH Keywords: even factor
zbMATH Keywords: 2-factor
zbMATH Keywords: Hamiltonian graphs
MaRDI profile type: Publication
full work available at URL: dmgt.2366
OpenAlex ID: W4247767215
cites work: An algorithmic proof of Tutte's f-factor theorem
cites work: The edge Hamiltonian path problem is NP-complete
cites work: Q5422499
cites work: Q3509400
cites work: Forbidden subgraphs that imply 2-factors
cites work: Characterizing forbidden pairs for hamiltonian properties
cites work: A pair of forbidden subgraphs and 2-factors
cites work: Reducibility among Combinatorial Problems
cites work: On the Computational Complexity of Combinatorial Problems
cites work: Forbidden subgraphs for supereulerian and Hamiltonian graphs
DOI: 10.7151/DMGT.2366
published in: Discussiones Mathematicae Graph Theory
description: scientific article; zbMATH DE number 7626212