AbstractWe give constructions of color-critical graphs and hypergraphs with no cycles of length 5 or shorter and with relatively few edges
AbstractThis paper gives new constructions of k-chromatic critical graphs with high minimum degree a...
Let $r$ be any positive integer. We prove that for every sufficiently large $k$ there exists a $k$-c...
AbstractA graph is chromatic-index-critical if it cannot be edge-coloured with Δ colours (with Δ the...
AbstractWe give constructions of color-critical graphs and hypergraphs with no cycles of length 5 or...
We consider questions regarding the existence of graphs and hypergraphs with certain coloring proper...
We consider questions regarding the existence of graphs and hypergraphs with certain coloring proper...
AbstractA simple graph is said to be of class 1 or of class 2 according as its chromatic index equal...
AbstractA graph G is called k-critical if G is k-chromatic but every proper subgraph of G has chroma...
This thesis focuses on extremal problems about coloring graphs and on finding rainbow matchings in e...
This thesis focuses on extremal problems about coloring graphs and on finding rainbow matchings in e...
AbstractWe consider those edge-minimal graphs having no homomorphism into the five-cycle. We charact...
AbstractWe give new lower bounds for the size of Δ-critical edge-chromatic graphs when 6 ⩽ Δ ⩽ 21
AbstractIt is shown that the minimal number of edges which have to be omitted from a (k + 1)-critica...
AbstractA graph G is called k-critical if χ(G) = k and χ(G − e) < χ(G) for each edge e of G, where χ...
AbstractSeveral structure theorems on chromatic index critical graphs are proved. New lower bounds o...
AbstractThis paper gives new constructions of k-chromatic critical graphs with high minimum degree a...
Let $r$ be any positive integer. We prove that for every sufficiently large $k$ there exists a $k$-c...
AbstractA graph is chromatic-index-critical if it cannot be edge-coloured with Δ colours (with Δ the...
AbstractWe give constructions of color-critical graphs and hypergraphs with no cycles of length 5 or...
We consider questions regarding the existence of graphs and hypergraphs with certain coloring proper...
We consider questions regarding the existence of graphs and hypergraphs with certain coloring proper...
AbstractA simple graph is said to be of class 1 or of class 2 according as its chromatic index equal...
AbstractA graph G is called k-critical if G is k-chromatic but every proper subgraph of G has chroma...
This thesis focuses on extremal problems about coloring graphs and on finding rainbow matchings in e...
This thesis focuses on extremal problems about coloring graphs and on finding rainbow matchings in e...
AbstractWe consider those edge-minimal graphs having no homomorphism into the five-cycle. We charact...
AbstractWe give new lower bounds for the size of Δ-critical edge-chromatic graphs when 6 ⩽ Δ ⩽ 21
AbstractIt is shown that the minimal number of edges which have to be omitted from a (k + 1)-critica...
AbstractA graph G is called k-critical if χ(G) = k and χ(G − e) < χ(G) for each edge e of G, where χ...
AbstractSeveral structure theorems on chromatic index critical graphs are proved. New lower bounds o...
AbstractThis paper gives new constructions of k-chromatic critical graphs with high minimum degree a...
Let $r$ be any positive integer. We prove that for every sufficiently large $k$ there exists a $k$-c...
AbstractA graph is chromatic-index-critical if it cannot be edge-coloured with Δ colours (with Δ the...
DOI
Add to ORKG