On Hadwiger's Number and the Stability Number

Cited in

(64)

On the complement graph and defensive \(k\)-alliances
On a relationship between Hadwiger and stability numbers
Some inequalities about connected domination number
On Hadwiger's number---A problem of the Nordhaus-Gaddum type
On weakly connected domination in graphs
2-connected graphs with small 2-connected dominating sets.
Algorithms for graphs with small octopus
Fractional colouring and Hadwiger's conjecture
Clique minors in graphs and their complements
Making a dominating set of a graph connected
Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity
Price of connectivity for the vertex cover problem and the dominating set problem: conjectures and investigation of critical graphs
The limit case of a domination property
Domination and total domination on asteroidal triple-free graphs
Clique immersions in graphs of independence number two with certain forbidden subgraphs
Connectivity and choosability of graphs with no \(K_t\) minor
Large immersions in graphs with independence number 3 and 4
Triameter of graphs
A special case of Hadwiger's conjecture
Boundary classes for graph problems involving non-local properties
On the doubly connected domination number of a graph
Improvements of the theorem of Duchet and Meyniel on Hadwiger's conjecture
Clique immersions and independence number
Graph theory. Abstracts from the workshop held January 2--8, 2022
Breaking the degeneracy barrier for coloring graphs with no K_t minor
The price of connectivity for cycle transversals
On the structure of graphs vertex critical with~respect to connected domination
New analysis and computational study for the planar connected dominating set problem
Connected domination
Short proofs of some extremal results. III
Colouring perfect graphs with bounded clique number
The price of connectivity for dominating set: upper bounds and complexity
The price of connectivity for feedback vertex set
2-edge connected dominating sets and 2-connected dominating sets of a graph
Clique minors in graphs with a forbidden subgraph
Bounds on the connected \(k\)-domination number in graphs
Connected domination in random graphs
Totally odd immersions in line graphs
Recent progress towards Hadwiger's conjecture
Large minors in graphs with given independence number
Coloring hypergraphs with excluded minors
\(k\)-domination and \(k\)-independence in graphs: A survey
Biclique immersions in graphs with independence number 2
On an induced version of Menger's theorem
Dense minors of graphs with independence number two
Connected domination versus dominating sets inducing large components
Dominating K_t-models
Complete bipartite immersion in graphs with independence number two: a simple proof
Some complexity results on semipaired domination in graphs
Independence number in triangle-free graphs avoiding a clique minor
Seymour and Woodall's conjecture holds for graphs with independence number two
Minors, connectivity, and diameter in randomly perturbed sparse graphs
Biclique immersions in graphs with independence number 2 (extended abstract)
Reducing linear Hadwiger's conjecture to coloring small graphs
Hadwiger numbers and over-dominating colourings
Odd clique minors in graphs with certain forbidden subgraphs
The price of connectivity for cycle transversals
Clique minors in claw-free graphs
Bibliography on domination in graphs and some basic definitions of domination parameters
Connected domination number and a new invariant in graphs with independence number three
Semitotal domination on AT-free graphs and circle graphs
On the Hadwiger's conjecture for graph products
Some remarks on the odd Hadwiger's conjecture
A basic elementary extension of the Duchet-Meyniel theorem

This page was built for publication: On Hadwiger's Number and the Stability Number

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