WebSite Logo
  • Content
  • Similar Resources
  • Metadata
  • Cite This
  • Log-in
  • Fullscreen
Log-in
Do not have an account? Register Now
Forgot your password? Account recovery
  1. Journal of Combinatorial Optimization
  2. Journal of Combinatorial Optimization : Volume 8
  3. Journal of Combinatorial Optimization : Volume 8, Issue 3, September 2004
  4. Vertex and Tree Arboricities of Graphs
Loading...

Please wait, while we are loading the content...

Journal of Combinatorial Optimization : Volume 33
Journal of Combinatorial Optimization : Volume 32
Journal of Combinatorial Optimization : Volume 31
Journal of Combinatorial Optimization : Volume 30
Journal of Combinatorial Optimization : Volume 29
Journal of Combinatorial Optimization : Volume 28
Journal of Combinatorial Optimization : Volume 27
Journal of Combinatorial Optimization : Volume 26
Journal of Combinatorial Optimization : Volume 25
Journal of Combinatorial Optimization : Volume 24
Journal of Combinatorial Optimization : Volume 23
Journal of Combinatorial Optimization : Volume 22
Journal of Combinatorial Optimization : Volume 21
Journal of Combinatorial Optimization : Volume 20
Journal of Combinatorial Optimization : Volume 19
Journal of Combinatorial Optimization : Volume 18
Journal of Combinatorial Optimization : Volume 17
Journal of Combinatorial Optimization : Volume 16
Journal of Combinatorial Optimization : Volume 15
Journal of Combinatorial Optimization : Volume 14
Journal of Combinatorial Optimization : Volume 13
Journal of Combinatorial Optimization : Volume 12
Journal of Combinatorial Optimization : Volume 11
Journal of Combinatorial Optimization : Volume 10
Journal of Combinatorial Optimization : Volume 9
Journal of Combinatorial Optimization : Volume 8
Journal of Combinatorial Optimization : Volume 8, Issue 4, December 2004
Journal of Combinatorial Optimization : Volume 8, Issue 3, September 2004
Equal Processing Time Bicriteria Scheduling on Parallel Machines
Minimal Tetrahedralizations of a Class of Polyhedra
On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the θ-Function
Vertex and Tree Arboricities of Graphs
Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee
Inverse Combinatorial Optimization: A Survey on Problems, Methods, and Results
Models and Bounds for Two-Dimensional Level Packing Problems
Even Cycles and Perfect Matching Problems with Side Constraints
Journal of Combinatorial Optimization : Volume 8, Issue 2, June 2004
Journal of Combinatorial Optimization : Volume 8, Issue 1, March 2004
Journal of Combinatorial Optimization : Volume 7
Journal of Combinatorial Optimization : Volume 6
Journal of Combinatorial Optimization : Volume 5
Journal of Combinatorial Optimization : Volume 4
Journal of Combinatorial Optimization : Volume 3
Journal of Combinatorial Optimization : Volume 2
Journal of Combinatorial Optimization : Volume 1

Similar Documents

...
Complexity of domination, hamiltonicity and treewidth for tree convex bipartite graphs

Article

...
Solving Steiner Tree Problems in Graphs with Lagrangian Relaxation

Article

...
Tagged Probe Interval Graphs

Article

...
Coupon coloring of some special graphs

Article

...
Necessary Edges in k-Chordalisations of Graphs

Article

...
An Edge-Splitting Algorithm in Planar Graphs

Article

...
Dynamic matchings in left vertex weighted convex bipartite graphs

Article

...
Optimization Problems in Medical Applications

Article

...
Adjacent vertex-distinguishing edge coloring of 2-degenerate graphs

Article

Vertex and Tree Arboricities of Graphs

Content Provider Springer Nature Link
Author Chang, Gerard J. Chen, Chiuyuan Chen, Yaping
Copyright Year 2004
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.
Starting Page 295
Ending Page 306
Page Count 12
File Format PDF
ISSN 13826905
Journal Journal of Combinatorial Optimization
Volume Number 8
Issue Number 3
e-ISSN 15732886
Language English
Publisher Kluwer Academic Publishers
Publisher Date 2004-01-01
Publisher Place Boston
Access Restriction One Nation One Subscription (ONOS)
Subject Keyword Theory of Computation Mathematical Modeling and Industrial Mathematics Combinatorics Convex and Discrete Geometry Optimization Operation Research/Decision Theory
Content Type Text
Resource Type Article
Subject Applied Mathematics Control and Optimization Discrete Mathematics and Combinatorics Computational Theory and Mathematics Computer Science Applications
  • About
  • Disclaimer
  • Feedback
  • Sponsor
  • Contact
  • Chat with Us
About National Digital Library of India (NDLI)
NDLI logo

National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.

Learn more about this project from here.

Disclaimer

NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.

Feedback

Sponsor

Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.

Contact National Digital Library of India
Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302
See location in the Map
03222 282435
Mail: support@ndl.gov.in
Sl. Authority Responsibilities Communication Details
1 Ministry of Education (GoI),
Department of Higher Education
Sanctioning Authority https://www.education.gov.in/ict-initiatives
2 Indian Institute of Technology Kharagpur Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project https://www.iitkgp.ac.in
3 National Digital Library of India Office, Indian Institute of Technology Kharagpur The administrative and infrastructural headquarters of the project Dr. B. Sutradhar  bsutra@ndl.gov.in
4 Project PI / Joint PI Principal Investigator and Joint Principal Investigators of the project Dr. B. Sutradhar  bsutra@ndl.gov.in
Prof. Saswat Chakrabarti  will be added soon
5 Website/Portal (Helpdesk) Queries regarding NDLI and its services support@ndl.gov.in
6 Contents and Copyright Issues Queries related to content curation and copyright issues content@ndl.gov.in
7 National Digital Library of India Club (NDLI Club) Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach clubsupport@ndl.gov.in
8 Digital Preservation Centre (DPC) Assistance with digitizing and archiving copyright-free printed books dpc@ndl.gov.in
9 IDR Setup or Support Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops idr@ndl.gov.in
I will try my best to help you...
Cite this Content
Loading...