On star and caterpillar arboricity
From MaRDI portal
Publication:1025569
DOI10.1016/J.DISC.2008.01.041zbMATH Open1228.05127DBLPjournals/dm/GoncalvesO09OpenAlexW1973171062WikidataQ56428506 ScholiaQ56428506MaRDI QIDQ1025569FDOQ1025569
Authors: Pascal Ochem, Daniel Gonçalves 
Publication date: 19 June 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.01.041
Recommendations
Cites Work
- Graph Classes: A Survey
- Acyclic Colourings of Planar Graphs with Large Girth
- The NP-Completeness of Edge-Coloring
- Decomposition of Finite Graphs Into Forests
- Some simplified NP-complete graph problems
- On the maximum average degree and the oriented chromatic number of a graph
- More about subcolorings
- Title not available (Why is that?)
- Star arboricity of graphs
- Caterpillar arboricity of planar graphs
- Title not available (Why is that?)
- The interval number of a planar graph: Three intervals suffice
- Subcolorings and the subchromatic number of a graph
- The subchromatic index of graphs
- Graph Subcolorings: Complexity and Algorithms
- Title not available (Why is that?)
Cited In (14)
- Caterpillar arboricity of planar graphs
- Trees, Paths, Stars, Caterpillars and Spiders
- The interval number of a planar graph is at most three
- Star arboricity
- On interval representations of graphs
- Two dependency constrained spanning tree problems
- The star arboricity of graphs
- Trees, paths, stars, caterpillars and spiders
- Edge-intersection graphs of grid paths: the bend-number
- Three ways to cover a graph
- 2-subcoloring is NP-complete for planar comparability graphs
- Local and union boxicity
- On some arboricities in planar graphs
- Star arboricity of graphs
This page was built for publication: On star and caterpillar arboricity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1025569)
