scientific article; zbMATH DE number 3102312

Cited in

(only showing first 100 items - show all)

The edge version of Hadwiger's conjecture
Hadwiger number and the Cartesian product of graphs
Hadwiger's conjecture for proper circular arc graphs
Linear connectivity forces large complete bipartite minors
Note on coloring graphs without odd-\(K_k\)-minors
List-coloring graphs without \(K_{4,k}\)-minors
Cliques, minors and apex graphs
Hadwiger's conjecture (ḵ\(=6):\) Neighbour configurations of 6-vertices in contraction-critical graphs
Hadwiger's conjecture for graphs on the Klein bottle
Kempe classes and the Hadwiger conjecture
On Tutte's extension of the four-colour problem
On the combinatorial problems which I would most like to see solved
On Hadwiger's number---A problem of the Nordhaus-Gaddum type
S-functions for graphs
Hajos' graph-coloring conjecture: Variations and counterexamples
Hadwiger's conjecture for \(K_ 6\)-free graphs
Fractional colouring and Hadwiger's conjecture
Clique minors in graphs and their complements
Hadwiger's conjecture for squares of 2-trees
On critical exponents of Dowling matroids
On the connection between the chromatic number of a graph and the number of cycles covering a vertex or an edge
Rooted complete minors in line graphs with a Kempe coloring
The extremal function for Petersen minors
Hadwiger's conjecture and inflations of the Petersen graph
On the structure of \(k\)-connected graphs without \(K_{k}\)-minor
On the conjecture of Hajos
Surfaces, tree-width, clique-minors, and partitions
The extremal function for complete minors
On clique immersions in line graphs
On group choosability of graphs. II
Clique immersions in graphs of independence number two with certain forbidden subgraphs
Simple graphs of order 12 and minimum degree 6 contain \(K_6\) minors
Notes on tree- and path-chromatic number
Dichromatic number and forced subdivisions
The characterization of graphs with no 2-connected spanning subgraph of \(V_8\) as a minor
Colouring non-even digraphs
Immersion and clustered coloring
Connectivity and choosability of graphs with no \(K_t\) minor
Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant
Large immersions in graphs with independence number 3 and 4
A new upper bound on the chromatic number of graphs with no odd \(K_t\) minor
Disproof of a conjecture by Woodall on the choosability of \(K_{s,t}\)-minor-free graphs
Some remarks on even-hole-free graphs
Clique immersion in graphs without a fixed bipartite graph
Efficient generation of different topological representations of graphs beyond-planarity
Maximal ambiguously \(k\)-colorable graphs
Erdős-Lovász Tihany conjecture for graphs with forbidden holes
Minimum degree condition for a graph to be knitted
A note on Hadwiger's conjecture for \(W_5\)-free graphs with independence number two
Packing seagulls
Coloring graphs with forbidden minors
\(K_{6}\) minors in 6-connected graphs of bounded tree-width
Sketchy tweets: ten minute conjectures in graph theory
On cyclically orientable graphs
Fractional coloring and the odd Hadwiger's conjecture
The extremal function for \(K_{9}\) minors
Reducing Hajós' 4-coloring conjecture to 4-connected graphs
On the odd-minor variant of Hadwiger's conjecture
A case of Hadwiger's conjecture
The extremal function for \(K_{8}^{-}\) minors
Clique immersions and independence number
Triangle-free projective-planar graphs with diameter two: domination and characterization
Graph theory. Abstracts from the workshop held January 2--8, 2022
Breaking the degeneracy barrier for coloring graphs with no K_t minor
Properties of 8-contraction-critical graphs with no K₇ minor
Bicircular matroids are 3-colorable
Dynamic coloring of graphs having no \(K_5\) minor
Hadwiger's conjecture and squares of chordal graphs
Hadwiger's conjecture
A characterization of graphs with no octahedron minor
Constructing graphs with no immersion of large complete graphs
Hadwiger's conjecture for the complements of Kneser graphs
Parameters tied to treewidth
Hadwiger number and chromatic number for near regular degree sequences
Coloring immersion-free graphs
A relative of Hadwiger's conjecture
Hadwiger's conjecture for quasi-line graphs
An approximate version of Hadwiger's conjecture for claw-free graphs
K₆-minors in triangulations and complete quadrangulations
A minimum degree condition forcing complete graph immersion
On the size of identifying codes in triangle-free graphs
Conflict-free coloring of graphs
Hadwiger's conjecture for inflations of 3-chromatic graphs
Odd complete minors in even embeddings on surfaces
Complete graph immersions in dense graphs
Efficient generation of different topological representations of graphs beyond-planarity
Improper colouring of graphs with no odd clique minor
Unique Colorability and Clique Minors
-Minors in triangulations on surfaces
Hadwiger's conjecture for graphs with forbidden holes
Some Conjectures and Questions in Chromatic Topological Graph Theory
List-coloring graphs without subdivisions and without immersions
Extremal functions for sparse minors
Strong complete minors in digraphs
Partitioning \(H\)-minor free graphs into three subgraphs with no large components
Partitioning \(H\)-minor free graphs into three subgraphs with no large components
A local epsilon version of Reed's conjecture
Clique immersion in graph products
Complete directed minors and chromatic number
A note on uniquely 10‐colorable graphs

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