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)

A tight Erdős-Pósa function for wheel minors
Clique immersions and independence number
Complete Minors in Graphs Without Sparse Cuts
Ramsey numbers of cubes versus cliques
Improper colouring of graphs with no odd clique minor
Lift-contractions
Solving the \textsc{induced subgraph} problem in the randomized multiparty simultaneous messages model
High-girth graphs avoiding a minor are nearly bipartite
Treewidth versus clique number. I: Graph classes with a forbidden structure
An extremal function for contractions of graphs
Average degree and contractibility
Chromatic number, induced cycles, and non-separating cycles
Hat Guessing Numbers of Strongly Degenerate Graphs
Large complete minors in random subgraphs
Tuza's conjecture for graphs with maximum average degree less than 7
Boxicity of graphs on surfaces
On the hat guessing number of graphs
Girth and treewidth
The Colin de Verdière parameter, excluded minors, and the spectral radius
A lower bound on the average degree forcing a minor
Every minor-closed property of sparse graphs is testable
Cycles of Given Size in a Dense Graph
Asymptotic density of graphs excluding disconnected minors
Packing and covering balls in graphs excluding a minor
Local search is a PTAS for feedback vertex set in minor-free graphs
Properties of 8-contraction-critical graphs with no \(K_7\) minor
Refined List Version of Hadwiger’s Conjecture
Note on coloring graphs without odd-\(K_k\)-minors
Boxicity, poset dimension, and excluded minors
Disjoint unions of complete minors
On the number of edges in a \(K_5\)-minor-free graph of given girth
On the number of cliques in graphs with a forbidden minor
Minors in graphs of large \(\theta_r\)-girth
Tournaments as strong subcontractions
List-coloring graphs without subdivisions and without immersions
Brooks' Theorem and Beyond
On the purity of minor-closed classes of graphs
The Hadwiger number of infinite vertex-transitive graphs
Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs
Additive non-approximability of chromatic number in proper minor-closed classes
Connectivity and choosability of graphs with no \(K_t\) minor
Immersion and clustered coloring
Improved bound for improper colourings of graphs with no odd clique minor
The extremal function and Colin de Verdière graph parameter
A new upper bound on the chromatic number of graphs with no odd \(K_t\) minor
Additive non-approximability of chromatic number in proper minor-closed classes
On the average crosscap number. II: Bounds for a graph
Average degree conditions forcing a minor
Online Node-weighted Steiner Forest and Extensions via Disk Paintings
scientific article; zbMATH DE number 3865318 (Why is no real title available?)
The extremal function for disconnected minors
A Weakening of the Odd Hadwiger's Conjecture
Forcing a sparse minor
Allowing each node to communicate only once in a distributed system: shared whiteboard models
Extremal density for sparse minors and subdivisions
Minors in graphs of large girth
On a recolouring version of Hadwiger's conjecture
The edge-density for \(K_{2,t}\) minors
Product structure of graph classes with bounded treewidth
Forcing unbalanced complete bipartite minors
Dense graphs have \(K_{3,t}\) minors
On the graph complement conjecture for minimum rank
Local Hadwiger's conjecture
Breaking the degeneracy barrier for coloring graphs with no \(K_t\) minor
Graph theory. Abstracts from the workshop held January 2--8, 2022
On the Hadwiger's conjecture for graph products
On \(K_{s,t}\)-minors in graphs with given average degree
Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
On the size of identifying codes in triangle-free graphs
Colouring planar graphs with three colours and no large monochromatic components
Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond
Contractibility and the Hadwiger conjecture
Linear connectivity forces large complete bipartite minors
Kernelization hardness of connectivity problems in \(d\)-degenerate graphs
Hadwiger's conjecture is true for almost every graph
Some remarks on even-hole-free graphs
A relaxed Hadwiger's conjecture for list colorings
Polynomial treewidth forces a large grid-like-minor
Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant
Large immersions in graphs with independence number 3 and 4
scientific article; zbMATH DE number 3935073 (Why is no real title available?)
A better lower bound on average degree of online \(k\)-list-critical graphs
Some remarks on the odd Hadwiger's conjecture
Rumor spreading with no dependence on conductance
Counting Small Induced Subgraphs Satisfying Monotone Properties
The extremal function for unbalanced bipartite minors
Isomorphism Testing for Graphs Excluding Small Minors
Polynomial kernels and faster algorithms for the dominating set problem on graphs with an excluded minor
Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets
Graphs without minor complete subgraphs
Complete directed minors and chromatic number
The sparse awakens: streaming algorithms for matching size estimation in sparse graphs
Extremal functions for sparse minors
On the extremal function for graph minors
A structure theorem for strong immersions
On \(K_{s,t}\)-minors in graphs with given average degree. II
Approximating the maximum clique minor and some subgraph homeomorphism problems
The extremal function for complete minors
Tree densities in sparse graph classes
Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs

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)