Pages that link to "Item:Q5565641"
From MaRDI portal
The following pages link to The Point-Arboricity of Planar Graphs (Q5565641):
Displaying 30 items.
- On the vertex-arboricity of \(K_5\)-minor-free graphs of diameter 2 (Q2436824) (← links)
- On acyclic colorings of planar graphs. (Reprint) (Q2497996) (← links)
- Chromatic sums for colorings avoiding monochromatic subgraphs (Q2516680) (← links)
- Uniquely k-arborable graphs (Q2548256) (← links)
- Vertex 2-arboricity of planar graphs without 4-cycles adjacent to 6-cycles (Q2680856) (← links)
- On the critical point-arboricity graphs (Q2778282) (← links)
- Vertex arboricity of planar graphs without chordal 6-cycles (Q2868169) (← links)
- Drawing Graphs on Few Lines and Few Planes (Q2961513) (← links)
- List strong linear 2-arboricity of sparse graphs (Q3005110) (← links)
- Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable (Q3652554) (← links)
- (Q3912614) (← links)
- (Q4041601) (← links)
- On Equitable List Arboricity of Graphs (Q5000322) (← links)
- Not all planar graphs are in PURE-4-DIR (Q5119380) (← links)
- $B$-sets and coloring problems (Q5590659) (← links)
- Vertex arboricity of graphs embedded in a surface of non-negative Euler characteristic (Q5859490) (← links)
- Partitioning a triangle-free planar graph into a forest and a forest of bounded degree (Q5890907) (← links)
- Acyclic colorings of planar graphs (Q5905418) (← links)
- Acyclic colorings of planar graphs (Q5921616) (← links)
- Extremal decompositions for Nordhaus-Gaddum theorems (Q6046167) (← links)
- Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration (Q6056774) (← links)
- An (F1,F4)‐partition of graphs with low genus and girth at least 6 (Q6056804) (← links)
- Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition (Q6143874) (← links)
- A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles (Q6173908) (← links)
- Partitioning kite‐free planar graphs into two forests (Q6201024) (← links)
- NC algorithms for partitioning sparse graphs into induced forests with an application (Q6487991) (← links)
- Interpolation theorems for the arboricity and the vertex arboricity of graphs (Q6565381) (← links)
- Partitioning planar graph of girth 5 into two forests with maximum degree 4. (Q6584423) (← links)
- Partitioning a planar graph without chordal 5-cycles into two forests. (Q6584425) (← links)
- Product structure of graphs with an excluded minor (Q6653803) (← links)
