The arboricity of graphs with minimum genus embeddings
From MaRDI portal
Cites work
- Covering planar graphs with forests
- Covering planar graphs with forests, one having bounded maximum degree
- Decomposing a graph into forests
- Decomposing a graph into forests and a matching
- Decomposing a graph into forests: the nine dragon tree conjecture is true
- Decomposition of Finite Graphs Into Forests
- Edge partition of graphs embeddable in the projective plane and the Klein bottle
- Edge-Disjoint Spanning Trees of Finite Graphs
- Graph theory
- Graph treewidth and geometric thickness parameters
- Graphes équilibrés et arboricité rationnelle. (Balanced graphs and rational arboricity)
- Graphs of groups on surfaces. Interactions and models
- Graphs with forbidden subgraphs
- scientific article; zbMATH DE number 4047749 (Why is no real title available?)
- scientific article; zbMATH DE number 3179262 (Why is no real title available?)
- scientific article; zbMATH DE number 3450230 (Why is no real title available?)
- scientific article; zbMATH DE number 3222646 (Why is no real title available?)
- On the thickness and arboricity of a graph
- The thickness of graphs: A survey
- Thickness and outerthickness for embedded graphs
This page was built for publication: The arboricity of graphs with minimum genus embeddings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7255120)