On Hadwiger's Number and the Stability Number

Cited in

(53)

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