On Hadwiger's Number and the Stability Number

Cited in

(53)

Connected domination number and a new invariant in graphs with independence number three
Connectivity and choosability of graphs with no \(K_t\) minor
A basic elementary extension of the Duchet-Meyniel theorem
Semitotal domination on AT-free graphs and circle graphs
On a relationship between Hadwiger and stability numbers
Coloring hypergraphs with excluded minors
\(k\)-domination and \(k\)-independence in graphs: A survey
Hadwiger numbers and over-dominating colourings
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
A special case of Hadwiger's conjecture
On the complement graph and defensive \(k\)-alliances
Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity
Bibliography on domination in graphs and some basic definitions of domination parameters
On Hadwiger's number---A problem of the Nordhaus-Gaddum type
Large immersions in graphs with independence number 3 and 4
Some remarks on the odd Hadwiger's conjecture
The price of connectivity for dominating set: upper bounds and complexity
Clique immersions in graphs of independence number two with certain forbidden subgraphs
The limit case of a domination property
Some inequalities about connected domination number
Fractional colouring and Hadwiger's conjecture
Biclique immersions in graphs with independence number 2
Boundary classes for graph problems involving non-local properties
Connected domination in random graphs
The price of connectivity for cycle transversals
Algorithms for graphs with small octopus
New analysis and computational study for the planar connected dominating set problem
Making a dominating set of a graph connected
Clique minors in graphs with a forbidden subgraph
On an induced version of Menger's theorem
2-connected graphs with small 2-connected dominating sets.
Recent progress towards Hadwiger's conjecture
Colouring perfect graphs with bounded clique number
Clique immersions and independence number
Domination and total domination on asteroidal triple-free graphs
Clique minors in graphs and their complements
Price of connectivity for the vertex cover problem and the dominating set problem: conjectures and investigation of critical graphs
Short proofs of some extremal results. III
Large minors in graphs with given independence number
Clique minors in claw-free graphs
Triameter of graphs
On weakly connected domination in graphs
2-edge connected dominating sets and 2-connected dominating sets of a graph
Bounds on the connected \(k\)-domination number in graphs
On the structure of graphs vertex critical with~respect to connected domination
On the doubly connected domination number of a graph
Totally odd immersions in line graphs
The price of connectivity for feedback vertex set
Connected domination
The price of connectivity for cycle transversals
Improvements of the theorem of Duchet and Meyniel on Hadwiger's conjecture

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)