On star and caterpillar arboricity
type: Item
instance of: scholarly article
title: On star and caterpillar arboricity
zbMATH Open document ID: 1228.05127
author: Pascal Ochem
author: Daniel Gonçalves
published in: Discrete Mathematics
publication date: 2009-06-19T00:00:00Z
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 5566762
zbMATH Keywords: NP-completeness
zbMATH Keywords: partitioning problems
zbMATH Keywords: edge coloring
MaRDI profile type: Publication
full work available at URL: j.disc.2008.01.041
OpenAlex ID: W1973171062
Wikidata QID: Q56428506
cites work: Acyclic Colourings of Planar Graphs with Large Girth
cites work: On the maximum average degree and the oriented chromatic number of a graph
cites work: Graph Classes: A Survey
cites work: More about subcolorings
cites work: Graph Subcolorings: Complexity and Algorithms
cites work: Q5445048
cites work: Some simplified NP-complete graph problems
cites work: Subcolorings and the subchromatic number of a graph
cites work: Caterpillar arboricity of planar graphs
cites work: Q3838186
cites work: Star arboricity of graphs
cites work: Q4734775
cites work: The NP-Completeness of Edge-Coloring
cites work: Q4949848
cites work: Decomposition of Finite Graphs Into Forests
cites work: The interval number of a planar graph: Three intervals suffice
DBLP publication ID: journals/dm/GoncalvesO09
DOI: 10.1016/J.DISC.2008.01.041
description: scientific article; zbMATH DE number 5566762