The following pages link to Path partitions of planar graphs (Q2481195):
Displaying 30 items.
- On 1-improper 2-coloring of sparse graphs (Q393935) (← links)
- Improper coloring of sparse graphs with a given girth. I: \((0,1)\)-colorings of triangle-free graphs (Q404440) (← links)
- \((k,1)\)-coloring of sparse graphs (Q409448) (← links)
- \((k,j)\)-coloring of sparse graphs (Q411834) (← links)
- Vertex decompositions of sparse graphs into an independent vertex set and a subgraph of maximum degree at most 1 (Q665888) (← links)
- Path partitions and packs of acyclic digraphs (Q1061135) (← links)
- Partitions of digraphs into paths or circuits (Q1084110) (← links)
- Finding the closed partition of a planar graph (Q1322561) (← links)
- Subdivisions in planar graphs (Q1366603) (← links)
- Path partitioning planar graphs of girth 4 without adjacent short cycles (Q1615735) (← links)
- Conditions for graphs to be path partition optimal (Q1709536) (← links)
- Splitting a planar graph of girth 5 into two forests with trees of small diameter (Q1752682) (← links)
- Plane triangulations are 6-partitionable (Q1849915) (← links)
- Path partitioning planar graphs with restrictions on short cycles (Q2234425) (← links)
- Near-colorings: non-colorable graphs and NP-completeness (Q2260631) (← links)
- Defective 2-colorings of sparse graphs (Q2434717) (← links)
- Graphs with a path partition for structuring digital spaces (Q2446382) (← links)
- Partitioning sparse plane graphs into two induced subgraphs of small degree (Q2454534) (← links)
- Improper coloring of sparse graphs with a given girth. II: Constructions (Q2800597) (← links)
- On alliance partitions and bisection width for planar graphs (Q2865020) (← links)
- Limits of near-coloring of sparse graphs (Q2874099) (← links)
- (1,<i>k</i>)-Coloring of Graphs with Girth at Least Five on a Surface (Q2978189) (← links)
- List strong linear 2-arboricity of sparse graphs (Q3005110) (← links)
- Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k (Q3055928) (← links)
- (Q3826577) (← links)
- Partitioning Planar Graphs (Q3990649) (← links)
- A Complexity Dichotomy for the Coloring of Sparse Graphs (Q4920652) (← links)
- On path partitions of the divisor graph (Q5220097) (← links)
- Partition of a planar graph with girth 6 into two forests with chain length at most 4 (Q5264731) (← links)
- Path partition of planar graphs with girth at least six (Q6059078) (← links)
