Splitting a graph into disjoint induced paths or cycles.
type: Item
instance of: scholarly article
title: Splitting a graph into disjoint induced paths or cycles.
zbMATH Open document ID: 1073.68031
DOI: 10.1016/S0166-218X(02)00425-0
author: Hoàng-Oanh Le
author: Van Bang Le
author: Haiko Müller
published in: Discrete Applied Mathematics
publication date: 2003-09-25T00:00:00Z
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 1985926
zbMATH Keywords: two-level clustered graphs
MaRDI profile type: Publication
cites work: Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
cites work: Complexity of Finding Embeddings in a k-Tree
cites work: Easy problems for tree-decomposable graphs
cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
cites work: The complexity of some problems related to GRAPH 3-COLORABILITY
cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
cites work: Q4198056
cites work: Treewidth. Computations and approximations
cites work: Q3745859
cites work: Graph minors. II. Algorithmic aspects of tree-width
Recommended article: Finding disjoint paths in split graphs
Recommended article: Finding Disjoint Paths in Split Graphs
Recommended article: Q4817890
Recommended article: Q5310215
Recommended article: Partitioning a graph into vertex-disjoint paths
Recommended article: Q4568185
Recommended article: Decomposition of graphs into paths and cycles
Recommended article: Q5205872
Recommended article: Partitioning graphs into paths or cycles of prescribed lengths
Recommended article: Q5310252
description: scientific article; zbMATH DE number 1985926