scientific article; zbMATH DE number 3661375

Cited in

(28)

Decomposing a planar graph of girth 5 into an independent set and a forest
On an upper bound of the graph's chromatic number, depending on the graph's degree and density
On acyclic colorings of planar graphs
The total chromatic number of any multigraph with maximum degree five is at most seven
Decomposing a planar graph into an independent set and a 3-degenerate graph
Injective edge-coloring of graphs with given maximum degree
Cover and variable degeneracy
Point partition numbers: decomposable and indecomposable critical graphs
The \(m\)-degenerate chromatic number of a digraph
Graphs with \(\chi=\Delta\) have big cliques
Brooks' Theorem and Beyond
Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable
Adapted game colouring of graphs
From the plane to higher surfaces
Vertex partition of hypergraphs and maximum degenerate subhypergraphs
Sparse graphs are near-bipartite
Coloring parameters for graphs on surfaces
My top 10 graph theory conjectures and open problems
Partitions of hypergraphs under variable degeneracy constraints
Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration
3‐Degenerate induced subgraph of a planar graph
Partitioning into degenerate graphs in linear time
Generalized DP-colorings of graphs
Degenerate and star colorings of graphs on surfaces
\((\mathcal{F}_1, \mathcal{F})\)-partition of plane graphs without 4- and 5-cycles and without ext-triangular 7-cycles
Brooks-type colourings of digraphs in linear time
Planar graphs without 4-, 5-, 8-cycles and special 6-cycles are near-bipartite
Planar graphs without short even cycles are near-bipartite

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3859822)