IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v8y2004i3d10.1023_bjoco.0000038912.82046.17.html
   My bibliography  Save this article

Vertex and Tree Arboricities of Graphs

Author

Listed:
  • Gerard J. Chang

    (National Taiwan University)

  • Chiuyuan Chen

    (National Chiao Tung University)

  • Yaping Chen

    (National Chiao Tung University)

Abstract

This paper studies the following variations of arboricity of graphs. The vertex (respectively, tree) arboricity of a graph G is the minimum number va(G) (respectively, ta(G)) of subsets into which the vertices of G can be partitioned so that each subset induces a forest (respectively, tree). This paper studies the vertex and the tree arboricities on various classes of graphs for exact values, algorithms, bounds, hamiltonicity and NP-completeness. The graphs investigated in this paper include block-cactus graphs, series-parallel graphs, cographs and planar graphs.

Suggested Citation

  • Gerard J. Chang & Chiuyuan Chen & Yaping Chen, 2004. "Vertex and Tree Arboricities of Graphs," Journal of Combinatorial Optimization, Springer, vol. 8(3), pages 295-306, September.
    • Handle: RePEc:spr:jcomop:v:8:y:2004:i:3:d:10.1023_b:joco.0000038912.82046.17
    DOI: 10.1023/B:JOCO.0000038912.82046.17
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/B:JOCO.0000038912.82046.17
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/B:JOCO.0000038912.82046.17?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Fabrice Talla Nobibon & Laurens Cherchye & Bram De Rock & Jeroen Sabbe & Frits Spieksma, 2011. "Heuristics for Deciding Collectively Rational Consumption Behavior," Computational Economics, Springer;Society for Computational Economics, vol. 38(2), pages 173-204, August.
    2. Jan Florek, 2016. "On Barnette’s conjecture and the $$H^{+-}$$ H + - property," Journal of Combinatorial Optimization, Springer, vol. 31(3), pages 943-960, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:8:y:2004:i:3:d:10.1023_b:joco.0000038912.82046.17. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.