Lower bound of the Hadwiger number of graphs by their average degree

Recommendations

The average lower domination number of graphs
Average lower domination number of graphs
On the average lower bondage number of a graph
On the average lower independence number of some graphs
A lower bound on the average size of a connected vertex set of a graph
The average lower independence number of total graphs
On the minimum of the Hadwiger number for graphs with a given mean degree of vertices
The average lower connectivity of graphs
scientific article; zbMATH DE number 3865318
On average lower independence and domination numbers in graphs

Cites work

scientific article; zbMATH DE number 3482343 (Why is no real title available?)
scientific article; zbMATH DE number 3102312 (Why is no real title available?)
Beweis einer Abschwächung der Hadwiger-Vermutung
Contractions of graphs: A theorem of Ore and an extremal problem
Homomorphiesätze für Graphen
On some graph-theoretical problems of V. G. Vizing
On the minimum of the Hadwiger number for graphs with a given mean degree of vertices

Cited in

(only showing first 100 items - show all)

Polynomial treewidth forces a large grid-like-minor
Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs
The Hadwiger number of infinite vertex-transitive graphs
High-girth graphs avoiding a minor are nearly bipartite
Logarithmically small minors and topological minors
Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
Forcing unbalanced complete bipartite minors
Dense graphs have \(K_{3,t}\) minors
On the odd-minor variant of Hadwiger's conjecture
On the size of identifying codes in triangle-free graphs
Strong complete minors in digraphs
Some remarks on the odd Hadwiger's conjecture
Fractional coloring and the odd Hadwiger's conjecture
On the graph complement conjecture for minimum rank
Note on coloring graphs without odd-\(K_k\)-minors
On the average crosscap number. II: Bounds for a graph
Packing and covering balls in graphs excluding a minor
Minors in graphs of large girth
scientific article; zbMATH DE number 3865318 (Why is no real title available?)
Tuza's conjecture for graphs with maximum average degree less than 7
A minimum degree condition forcing complete graph immersion
Every minor-closed property of sparse graphs is testable
Homomorphisms and related contractions of graphs
The extremal function for complete minors
Colouring planar graphs with three colours and no large monochromatic components
A Weakening of the Odd Hadwiger's Conjecture
Average degree and contractibility
On the number of cliques in graphs with a forbidden minor
Polynomial kernels and faster algorithms for the dominating set problem on graphs with an excluded minor
Minors in graphs of large \(\theta_r\)-girth
Hat Guessing Numbers of Strongly Degenerate Graphs
The edge-density for \(K_{2,t}\) minors
Ramsey numbers of cubes versus cliques
On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion
Disjoint unions of complete minors
List-coloring graphs without subdivisions and without immersions
Some recent progress and applications in graph minor theory
Rank-width and tree-width of \(H\)-minor-free graphs
Boxicity, poset dimension, and excluded minors
Small minors in dense graphs
Linear connectivity forces large complete bipartite minors
On the Hadwiger's conjecture for graph products
Graphs without minor complete subgraphs
Boxicity of graphs on surfaces
Asymptotic density of graphs excluding disconnected minors
The extremal function for unbalanced bipartite minors
Contractibility and the Hadwiger conjecture
Kernelization hardness of connectivity problems in \(d\)-degenerate graphs
Counting Small Induced Subgraphs Satisfying Monotone Properties
Cliques in graphs excluding a complete graph minor
Small complete minors above the extremal edge density
The parameterized complexity of editing graphs for bounded degeneracy
An extremal function for contractions of graphs
On \(K_{s,t}\)-minors in graphs with given average degree. II
The extremal function for \(K_{9}\) minors
Coloring immersion-free graphs
Short proofs of some extremal results. II.
On \(K_{s,t}\)-minors in graphs with given average degree
Brooks' Theorem and Beyond
Online Node-weighted Steiner Forest and Extensions via Disk Paintings
Average degree conditions forcing a minor
A relaxed Hadwiger's conjecture for list colorings
The extremal function for Petersen minors
On the extremal function for graph minors
Hadwiger's conjecture
Graph theory. Abstracts from the workshop held January 2--8, 2022
Hadwiger's conjecture is true for almost every graph
Forcing a sparse minor
Circumference and pathwidth of highly connected graphs
Girth and treewidth
The saga of minimum spanning trees
Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets
Cycles of Given Size in a Dense Graph
Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond
Chromatic number, induced cycles, and non-separating cycles
Approximating sparse quadratic programs
On the Hadwiger number of Kneser graphs and their random subgraphs
Approximating the maximum clique minor and some subgraph homeomorphism problems
Improved bound for improper colourings of graphs with no odd clique minor
The sparse awakens: streaming algorithms for matching size estimation in sparse graphs
Refined List Version of Hadwiger’s Conjecture
The minimum number of minimal codewords in an \([n, k]\)-code and in graphic codes
Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs
Tree densities in sparse graph classes
A tight Erdős-Pósa function for wheel minors
Tournaments as strong subcontractions
The extremal function and Colin de Verdière graph parameter
Computation of Hadwiger number and related contraction problems. Tight lower bounds
Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs
Constant congestion brambles in directed graphs
Solving the \textsc{induced subgraph} problem in the randomized multiparty simultaneous messages model
A new upper bound on the chromatic number of graphs with no odd \(K_t\) minor
Some remarks on even-hole-free graphs
Local search is a PTAS for feedback vertex set in minor-free graphs
List-coloring graphs without \(K_{4,k}\)-minors
On a recolouring version of Hadwiger's conjecture
Lift-contractions
Local Hadwiger's conjecture
Disproof of a conjecture by Woodall on the choosability of \(K_{s,t}\)-minor-free graphs
A structure theorem for strong immersions

This page was built for publication: Lower bound of the Hadwiger number of graphs by their average degree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q760439)