scientific article; zbMATH DE number 3102312
From MaRDI portal
zbMath0061.41308MaRDI QIDQ5837979
Publication date: 1943
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Bicircular matroids are 3-colorable, Dynamic coloring of graphs having no \(K_5\) minor, Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant, Large immersions in graphs with independence number 3 and 4, Hadwiger's conjecture for squares of 2-trees, Coloring immersion-free graphs, 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, On a new reformulation of Hadwiger's conjecture, On critical exponents of Dowling matroids, On the connectivity of minimum and minimal counterexamples to Hadwiger's conjecture, Packing seagulls, Constructing Graphs with No Immersion of Large Complete Graphs, Some remarks on even-hole-free graphs, Hadwiger's conjecture for circular colorings of edge-weighted graphs, On the Hadwiger's conjecture for graph products, On the connection between the chromatic number of a graph and the number of cycles covering a vertex or an edge, Hadwiger's conjecture (ḵ\(=6):\) Neighbour configurations of 6-vertices in contraction-critical graphs, Clique immersion in graphs without a fixed bipartite graph, Coloring graphs with forbidden minors, Some recent progress and applications in graph minor theory, Graphs without minor complete subgraphs, Hadwiger Number of Graphs with Small Chordality, Distance constraints in graph color extensions, A relaxed Hadwiger's conjecture for list colorings, Clique immersions and independence number, A minimum degree condition forcing complete graph immersion, \(K_{6}\) minors in 6-connected graphs of bounded tree-width, Hadwiger's conjecture for graphs on the Klein bottle, Hadwiger's Conjecture for the Complements of Kneser Graphs, Sketchy tweets: ten minute conjectures in graph theory, On the size of identifying codes in triangle-free graphs, Triangle-free projective-planar graphs with diameter two: domination and characterization, Graph theory. Abstracts from the workshop held January 2--8, 2022, Kempe classes and the Hadwiger conjecture, On Tutte's extension of the four-colour problem, Efficient generation of different topological representations of graphs beyond-planarity, Large minors in graphs with given independence number, Breaking the degeneracy barrier for coloring graphs with no \(K_t\) minor, Properties of 8-contraction-critical graphs with no \(K_7\) minor, Parameters Tied to Treewidth, On the combinatorial problems which I would most like to see solved, On cyclically orientable graphs, Hadwiger's conjecture for inflations of 3-chromatic graphs, Rooted complete minors in line graphs with a Kempe coloring, Odd complete minors in even embeddings on surfaces, Some remarks on the odd Hadwiger's conjecture, Complete graph immersions in dense graphs, The extremal function for Petersen minors, Fractional coloring and the odd Hadwiger's conjecture, On Hadwiger's number---A problem of the Nordhaus-Gaddum type, \(K_{6}\) minors in large 6-connected graphs, A basic elementary extension of the Duchet-Meyniel theorem, Hadwiger's conjecture and inflations of the Petersen graph, On clique immersions in line graphs, On the structure of \(k\)-connected graphs without \(K_{k}\)-minor, The extremal function for \(K_{9}\) minors, On group choosability of graphs. II, On Seymour's strengthening of Hadwiger's conjecture for graphs with certain forbidden subgraphs, Contractibility and the Hadwiger conjecture, Reducing Hajós' 4-coloring conjecture to 4-connected graphs, S-functions for graphs, Clique immersions in graphs of independence number two with certain forbidden subgraphs, Hadwiger number and chromatic number for near regular degree sequences, A note on graph minors and strong products, Hadwiger's conjecture for 3-arc graphs, Maximal ambiguously \(k\)-colorable graphs, Hajos' graph-coloring conjecture: Variations and counterexamples, Simple graphs of order 12 and minimum degree 6 contain \(K_6\) minors, On the odd-minor variant of Hadwiger's conjecture, The edge version of Hadwiger's conjecture, Hadwiger number and the Cartesian product of graphs, Hadwiger’s Conjecture and Squares of Chordal Graphs, Notes on tree- and path-chromatic number, Hadwiger's conjecture for proper circular arc graphs, Hadwiger’s Conjecture, Linear connectivity forces large complete bipartite minors, Note on coloring graphs without odd-\(K_k\)-minors, Lower bound of the Hadwiger number of graphs by their average degree, Erdős-Lovász Tihany conjecture for graphs with forbidden holes, List-coloring graphs without \(K_{4,k}\)-minors, Faster approximation schemes and parameterized algorithms on (odd-)\(H\)-minor-free graphs, Clique minors in claw-free graphs, Fractional colouring and Hadwiger's conjecture, Clique minors in graphs and their complements, Dichromatic number and forced subdivisions, A case of Hadwiger's conjecture, Minimum degree condition for a graph to be knitted, On the conjecture of Hajos, Cliques, minors and apex graphs, A note on Hadwiger's conjecture for \(W_5\)-free graphs with independence number two, The characterization of graphs with no 2-connected spanning subgraph of \(V_8\) as a minor, A Characterization of Graphs with No Octahedron Minor, The extremal function for \(K_{8}^{-}\) minors, Colouring non-even digraphs, Surfaces, tree-width, clique-minors, and partitions, The extremal function for complete minors, Immersion and clustered coloring, Connectivity and choosability of graphs with no \(K_t\) minor, Hadwiger's conjecture for \(K_ 6\)-free graphs, Strong complete minors in digraphs, -Minors in triangulations on surfaces, A Relative of Hadwiger's Conjecture, Conflict-Free Coloring of Graphs, Hadwiger's Conjecture for Graphs with Forbidden Holes, Clique immersion in graph products, Complete directed minors and chromatic number, A note on uniquely 10‐colorable graphs, On odd colorings of planar graphs, Strong chromatic index and Hadwiger number, Weakening total coloring conjecture and Hadwiger's conjecture on total graphs, Complete minors in complements of nonseparating planar graphs, Subgraphs of large connectivity and chromatic number, Strengthening Hadwiger's conjecture for 4- and 5-chromatic graphs, Disjointness graphs of short polygonal chains, Bipartite graphs with no \(K_6\) minor, Local Hadwiger's conjecture, Refined List Version of Hadwiger’s Conjecture, Recent progress towards Hadwiger's conjecture, Hadwiger's conjecture for quasi-line graphs, Partitioning \(H\)-minor free graphs into three subgraphs with no large components, Forcing clique immersions through chromatic number, Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity, An approximate version of Hadwiger's conjecture for claw-free graphs, Partitioning \(H\)-minor free graphs into three subgraphs with no large components, A local epsilon version of Reed's conjecture, K6-minors in triangulations and complete quadrangulations, Improper colouring of graphs with no odd clique minor, Some Conjectures and Questions in Chromatic Topological Graph Theory, Unnamed Item, Extremal functions for sparse minors, Unique Colorability and Clique Minors
