Pages that link to "Item:Q5379836"
From MaRDI portal
The following pages link to Improper coloring of graphs on surfaces (Q5379836):
Displaying 20 items.
- From the plane to higher surfaces (Q444375) (← links)
- Coloring face hypergraphs on surfaces (Q703607) (← links)
- Improper choosability of graphs embedded on the surface of genus \(r\) (Q1402089) (← links)
- Fixing improper colorings of graphs (Q1698729) (← links)
- Colouring planar graphs with bounded monochromatic components (Q2182229) (← links)
- Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests (Q2219964) (← links)
- Clustered variants of Hajós' conjecture (Q2664549) (← links)
- The number of defective colorings of graphs on surfaces (Q3174242) (← links)
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency (Q3728016) (← links)
- A note on defective colorings of graphs in surfaces (Q3800061) (← links)
- Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs (Q4564884) (← links)
- Parameterized (Approximate) Defective Coloring (Q5107096) (← links)
- Defective and clustered choosability of sparse graphs (Q5222556) (← links)
- Coloring parameters for graphs on surfaces (Q5301024) (← links)
- Clustered colouring of graph classes with bounded treedepth or pathwidth (Q5885188) (← links)
- Clustered 3-colouring graphs of bounded degree (Q5886311) (← links)
- Every planar graph without 4-cycles and 5-cycles is (3,3)-colorable (Q6081925) (← links)
- Graph partitions under average degree constraint (Q6187347) (← links)
- Clustered coloring of graphs with bounded layered treewidth and bounded degree (Q6612290) (← links)
- Colouring strong products (Q6612523) (← links)
