scientific article; zbMATH DE number 3195967

Cited in

(82)

Ore-type versions of Brooks' theorem
Good characterizations for some degree constrained subgraphs
On list critical graphs
On matroids induced by packing subgraphs
On constructive methods in the theory of colour-critical graphs
The enumeration problem for color critical linear hypergraphs
Critical hypergraphs for the weak chromatic number
On graphs critical with respect to vertex partition numbers
On 4-critical planar graphs with high edge density
Approximating maximum independent sets by excluding subgraphs
Excess in critical graphs
On the minimal number of edges in color-critical graphs
A class of edge critical 4-chromatic graphs
Color-critical graphs on a fixed surface
A new lower bound on the number of edges in colour-critical graphs and hypergraphs
Colour-critical graphs with few edges
Extension from precoloured sets of edges
A note on chromatic number and induced odd cycles
Critical \((P_6, \mathrm{banner})\)-free graphs
Partitioning sparse graphs into an independent set and a forest of bounded degree
A Brooks type theorem for the maximum local edge connectivity
A better lower bound on average degree of online \(k\)-list-critical graphs
The fractional chromatic number of triangle-free graphs with \(\varDelta \leq 3\)
4-chromatic graphs with large odd girth
Antidirected paths in 5-chromatic digraphs
Note on a conjecture of Toft
On the number of edges in hypergraphs critical with respect to strong colourings
Independent sets in \(n\)-vertex \(k\)-chromatic \(\ell \)-connected graphs
Cover and variable degeneracy
On the dichromatic number of surfaces
Point partition numbers: decomposable and indecomposable critical graphs
Smallest \(C_{2 \ell + 1}\)-critical graphs of odd-girth \(2 k + 1\)
The minimum number of edges in 4-critical digraphs of given order
On 4-chromatic Schrijver graphs: their structure, non-3-colorability, and critical edges
Coloring near-quadrangulations of the cylinder and the torus
Improved lower bounds on the number of edges in list critical and online list critical graphs
Hajós and Ore constructions for digraphs
Distributed coloring in sparse graphs with fewer colors
Squarefree monomial ideals that fail the persistence property and non-increasing depth
On DP-coloring of graphs and multigraphs
Beyond degree choosability
On the minimum number of edges in triangle-free 5-critical graphs
A proof of Tomescu's graph coloring conjecture
On an adjacency property of almost all tournaments
Replication in critical graphs and the persistence of monomial ideals
Counterexamples to Grötzsch-Sachs-Koester's conjecture
Colour-critical graphs and hypergraphs
On \(K_{s,t}\) minors in \((s+t)\)-chromatic graphs
A better lower bound on average degree of 4-list-critical graphs
scientific article; zbMATH DE number 3724489 (Why is no real title available?)
Graphs with chromatic number close to maximum degree
Ore's conjecture on color-critical graphs is almost true
Orientations of graphs with prescribed weighted out-degrees
Approximating maximum independent sets by excluding subgraphs
Digraphs and variable degeneracy
Degree choosable signed graphs
The edge density of critical digraphs
The orientable genus of the join of a cycle and a complete graph
Six-Critical Graphs on the Klein Bottle
Coloring Triangle-Free Graphs on Surfaces
Color-critical graphs have logarithmic circumference
Some Conjectures and Questions in Chromatic Topological Graph Theory
\(k\)-critical graphs in \(P_5\)-free graphs
k-critical graphs in P₅-free graphs
Induced graph packing problems
Weak degeneracy of graphs
The Fractional Chromatic Number of \(\boldsymbol{K_{\Delta }}\)-Free Graphs
Generalized DP-colorings of graphs
Various bounds on the minimum number of arcs in a k-dicritical digraph
Some results on \(k\)-critical \(P_5\)-free graphs
On the edge-density of 4-critical graphs
On the minimum number of arcs in \(k\)-dicritical oriented graphs
Subdivisions in dicritical digraphs with large order or digirth
Sparsity of 3-flow-critical graphs
The 3-dicritical semi-complete digraphs
Coloring vertices and faces of maps on surfaces
Five-coloring graphs on the Klein bottle
A lower bound on the number of edges in DP-critical graphs
On strongly and robustly critical graphs
Planar 4-critical graphs with four triangles
On critical subgraphs of colour-critical graphs
Sparse colour-critical hypergraphs

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 Q5732334)