scientific article; zbMATH DE number 7656343
From MaRDI portal
Publication:5878782
DOI10.3770/j.issn:2095-2651.2023.01.003MaRDI QIDQ5878782
Publication date: 22 February 2023
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Planar graphs with girth at least 5 are \((3, 5)\)-colorable
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Defective 2-colorings of planar graphs without 4-cycles and 5-cycles
- Every planar graph without 4-cycles and 5-cycles is \((2, 6)\)-colorable
- Partitioning sparse graphs into an independent set and a graph with bounded size components
- Near-colorings: non-colorable graphs and NP-completeness
- List strong linear 2-arboricity of sparse graphs
- On the linear vertex-arboricity of a planar graph
- Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths
- Improper choosability of graphs and maximum average degree
- Partitioning a triangle-free planar graph into a forest and a forest of bounded degree
This page was built for publication:
