scientific article; zbMATH DE number 3195967
From MaRDI portal
Publication:5732334
zbMath0121.18401MaRDI QIDQ5732334
Publication date: 1963
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (76)
On the dichromatic number of surfaces ⋮ On DP-coloring of graphs and multigraphs ⋮ Antidirected paths in 5-chromatic digraphs ⋮ Point partition numbers: decomposable and indecomposable critical graphs ⋮ A better lower bound on average degree of 4-list-critical graphs ⋮ Six-Critical Graphs on the Klein Bottle ⋮ Digraphs and Variable Degeneracy ⋮ Note on a conjecture of Toft ⋮ A class of edge critical 4-chromatic graphs ⋮ On matroids induced by packing subgraphs ⋮ Smallest \(C_{2 \ell + 1}\)-critical graphs of odd-girth \(2 k + 1\) ⋮ Extension from precoloured sets of edges ⋮ Color-critical graphs on a fixed surface ⋮ Beyond degree choosability ⋮ On the minimum number of edges in triangle-free 5-critical graphs ⋮ On constructive methods in the theory of colour-critical graphs ⋮ The minimum number of edges in 4-critical digraphs of given order ⋮ Induced graph packing problems ⋮ A note on chromatic number and induced odd cycles ⋮ Weak degeneracy of graphs ⋮ The Fractional Chromatic Number of \(\boldsymbol{K_{\Delta }}\)-Free Graphs ⋮ A proof of Tomescu's graph coloring conjecture ⋮ Generalized DP-colorings of graphs ⋮ Graphs with chromatic number close to maximum degree ⋮ On the edge-density of 4-critical graphs ⋮ The enumeration problem for color critical linear hypergraphs ⋮ Various bounds on the minimum number of arcs in a \(k\)-dicritical digraph ⋮ Some results on \(k\)-critical \(P_5\)-free graphs ⋮ Critical hypergraphs for the weak chromatic number ⋮ A new lower bound on the number of edges in colour-critical graphs and hypergraphs ⋮ On an adjacency property of almost all tournaments ⋮ Replication in critical graphs and the persistence of monomial ideals ⋮ On graphs critical with respect to vertex partition numbers ⋮ Unnamed Item ⋮ Ore's conjecture on color-critical graphs is almost true ⋮ On 4-chromatic Schrijver graphs: their structure, non-3-colorability, and critical edges ⋮ Coloring Triangle-Free Graphs on Surfaces ⋮ Coloring near-quadrangulations of the cylinder and the torus ⋮ On the number of edges in hypergraphs critical with respect to strong colourings ⋮ Critical \((P_6, \mathrm{banner})\)-free graphs ⋮ Orientations of graphs with prescribed weighted out-degrees ⋮ On 4-critical planar graphs with high edge density ⋮ Degree choosable signed graphs ⋮ Approximating maximum independent sets by excluding subgraphs ⋮ The edge density of critical digraphs ⋮ 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\) ⋮ Excess in critical graphs ⋮ Counterexamples to Grötzsch-Sachs-Koester's conjecture ⋮ Color-critical graphs have logarithmic circumference ⋮ Coloring vertices and faces of maps on surfaces ⋮ Five-coloring graphs on the Klein bottle ⋮ Approximating maximum independent sets by excluding subgraphs ⋮ On Ks,t minors in (s+t)-chromatic graphs ⋮ Independent sets in \(n\)-vertex \(k\)-chromatic \(\ell \)-connected graphs ⋮ Improved lower bounds on the number of edges in list critical and online list critical graphs ⋮ Ore-type versions of Brooks' theorem ⋮ Good characterizations for some degree constrained subgraphs ⋮ \(k\)-critical graphs in \(P_5\)-free graphs ⋮ Planar 4-critical graphs with four triangles ⋮ \(k\)-critical graphs in \(P_5\)-free graphs ⋮ The orientable genus of the join of a cycle and a complete graph ⋮ Hajós and Ore constructions for digraphs ⋮ On the minimal number of edges in color-critical graphs ⋮ On critical subgraphs of colour-critical graphs ⋮ Cover and variable degeneracy ⋮ Colour-critical graphs and hypergraphs ⋮ On list critical graphs ⋮ 4-chromatic graphs with large odd girth ⋮ Colour-critical graphs with few edges ⋮ Some Conjectures and Questions in Chromatic Topological Graph Theory ⋮ Distributed coloring in sparse graphs with fewer colors ⋮ Sparse colour-critical hypergraphs ⋮ Squarefree monomial ideals that fail the persistence property and non-increasing depth
This page was built for publication:
