scientific article
From MaRDI portal
Publication:3859822
zbMath0425.05058MaRDI QIDQ3859822
Publication date: 1976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (25)
The \(m\)-degenerate chromatic number of a digraph ⋮ Point partition numbers: decomposable and indecomposable critical graphs ⋮ Coloring parameters for graphs on surfaces ⋮ The total chromatic number of any multigraph with maximum degree five is at most seven ⋮ Brooks' Theorem and Beyond ⋮ Graphs with $\chi=\Delta$ Have Big Cliques ⋮ 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 ⋮ Adapted game colouring of graphs ⋮ From the plane to higher surfaces ⋮ Sparse Graphs Are Near-Bipartite ⋮ Degenerate and star colorings of graphs on surfaces ⋮ On an upper bound of the graph's chromatic number, depending on the graph's degree and density ⋮ Injective edge-coloring of graphs with given maximum degree ⋮ Vertex partition of hypergraphs and maximum degenerate subhypergraphs ⋮ On acyclic colorings of planar graphs ⋮ Decomposing a planar graph of girth 5 into an independent set and a forest ⋮ Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable ⋮ Cover and variable degeneracy ⋮ Planar graphs without short even cycles are near-bipartite ⋮ My Top 10 Graph Theory Conjectures and Open Problems ⋮ Decomposing a planar graph into an independent set and a 3-degenerate graph
This page was built for publication:
