Forbidden subgraphs and the existence of a 2-walk
type: Item
instance of: scholarly article
title: Forbidden subgraphs and the existence of a 2-walk
zbMATH Open document ID: 1298.05301
author: Michitaka Furuya
published in: Discrete Mathematics
publication date: 2014-08-21T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C60
zbMATH DE Number: 6333280
zbMATH Keywords: \(k\)-walk
zbMATH Keywords: 2-walk
zbMATH Keywords: forbidden subgraph
zbMATH Keywords: toughness
MaRDI profile type: Publication
full work available at URL: j.disc.2014.06.013
OpenAlex ID: W2079485979
cites work: Q3577833
cites work: Toughness, trees, and walks
cites work: Forbidden induced subgraphs for star-free graphs
cites work: A pair of forbidden subgraphs and perfect matchings.
cites work: 2-walks in circuit graphs
cites work: Q4014627
cites work: Q4818793
cites work: Forbidden Induced Subgraphs for Toughness
DOI: 10.1016/J.DISC.2014.06.013
Recommended article: Forbidden subgraphs and the existence of a 2-factor
Recommended article: Q3635524
Recommended article: Forbidden subgraphs for existences of (connected) 2-factors of a graph
Recommended article: Forbidden subgraphs and the existence of paths and cycles passing through specified vertices
Recommended article: Q3826590
Recommended article: Forbidden subgraphs and forbidden substructures
Recommended article: Q3838206
Recommended article: Forbidden subgraphs that imply 2-factors
Recommended article: Forbidden subgraphs in connected graphs
Recommended article: Pairs and triples of forbidden subgraphs and the existence of a 2‐factor
description: scientific article; zbMATH DE number 6333280