Skip to search formSkip to main contentSkip to account menu

Hadwiger number

In graph theory, the Hadwiger number of an undirected graph G is the size of the largest complete graph that can be obtained by contracting edges of… 
Wikipedia (opens in a new tab)

Related topics

Related topics

27 relations
Apex graphBiconnected componentClique (graph theory)Clique-sum

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Lower bounds for treewidth of product graphs
2014
2014
Connected matchings in chordal bipartite graphs
2010
2010
Hadwiger number and chromatic number for near regular degree sequences
We consider a problem related to Hadwiger's Conjecture. Let D=(d1, d2, …, dn) be a graphic sequence with 0⩽d1⩽d2⩽···⩽dn⩽n−1. Any… 
2008
2008
A basic elementary extension of the Duchet-Meyniel theorem
2007
2007
The Hadwiger Number of Jordan Regions Is Unbounded
We show that for every n > 0 there is a planar topological disk A0 and n translates A1, A2, ..., An of A0 such that the interiors… 
2007
2007
On the Hadwiger's conjecture for graph products
1988
1988
The heat-shock response in higher plants: a biochemical model
Abstract A compilation of existing data on higher plant responses to heat-shock temperatures has been utilized to produce a… 
1987
1987
On a relationship between Hadwiger and stability numbers
1983
1983
Ensemble Convexes dans les Graphes I: Théorèmes de Helly et de Radon pour Graphes et Surfaces
1978
1978
Contractions of graphs: A theorem of ore and an extremal problem
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)