Simple planar graph partition into three forests
From MaRDI portal
Publication:1392570
DOI10.1016/S0166-218X(98)00007-9zbMath0907.05019MaRDI QIDQ1392570
Publication date: 2 March 1999
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (4)
Approximation algorithms for aligning points ⋮ Simple planar graph partition into three forests ⋮ Fully dynamic arboricity maintenance ⋮ Almost-smooth histograms and sliding-window graph algorithms
Cites Work
- On the succinct representation of graphs
- Representation of graphs
- Planar graphs: Theory and algorithms
- A short proof of Nash-Williams' theorem for the arboricity of a graph
- Simple planar graph partition into three forests
- Short encodings of planar graphs and maps
- A matroid approach to finding edge connectivity and packing arborescences
- Succinct representation of general unlabeled graphs
- An unexpected result in coding the vertices of a graph
- Efficient algorithms for vertex arboricity of planar graphs
- Edge-Disjoint Spanning Trees of Finite Graphs
- A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory
- Implicat Representation of Graphs
- Efficient Planarity Testing
- Coding the vertexes of a graph
- Unnamed Item
- Unnamed Item
This page was built for publication: Simple planar graph partition into three forests
