The following pages link to On Partitioning Planar Graphs (Q5554152):
Displaying 16 items.
- Graph properties and hypergraph colourings (Q1184854) (← links)
- On acyclic colorings of planar graphs (Q1257487) (← links)
- The existence of uniquely \(-G\) colourable graphs (Q1377702) (← links)
- Conditional chromatic numbers with forbidden cycles (Q1805306) (← links)
- The subchromatic number of a graph (Q1823255) (← links)
- Generalized perfect graphs: Characterizations and inversion (Q1894378) (← links)
- The complexity of generalized graph colorings (Q1923585) (← links)
- Point partition numbers: perfect graphs (Q2115144) (← links)
- Point partition numbers: decomposable and indecomposable critical graphs (Q2142640) (← links)
- A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs (Q2142650) (← links)
- On acyclic colorings of planar graphs. (Reprint) (Q2497996) (← links)
- A Canonical Ramsey Theorem (Q4019375) (← links)
- ON UNIQUELY -G k-COLOURABLE GRAPHS (Q4034558) (← links)
- The biparticity of a graph (Q4154589) (← links)
- Acyclic colorings of planar graphs (Q5921616) (← links)
- Generalized DP-colorings of graphs (Q6091813) (← links)
