Vertex partitions of \((C_3, C_4, C_6)\)-free planar graphs (Q2324512): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Defective 2-colorings of sparse graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Complexity Dichotomy for the Coloring of Sparse Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Improper coloring of sparse graphs with a given girth. I: \((0,1)\)-colorings of triangle-free graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Near-colorings: non-colorable graphs and NP-completeness / rank | |||
Normal rank | |||
Latest revision as of 09:48, 20 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Vertex partitions of \((C_3, C_4, C_6)\)-free planar graphs |
scientific article |
Statements
Vertex partitions of \((C_3, C_4, C_6)\)-free planar graphs (English)
0 references
11 September 2019
0 references
improper colorings
0 references
planar graphs
0 references
0 references
