On Hadwiger's Number and the Stability Number
From MaRDI portal
Publication:3672036
DOI10.1016/S0304-0208(08)73549-7zbMath0522.05060OpenAlexW1033655406MaRDI QIDQ3672036
Publication date: 1982
Published in: Graph Theory, Proceedings of the Conference on Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-0208(08)73549-7
Related Items (52)
Connected domination number and a new invariant in graphs with independence number three ⋮ Semitotal domination on AT-free graphs and circle graphs ⋮ Large immersions in graphs with independence number 3 and 4 ⋮ On a relationship between Hadwiger and stability numbers ⋮ On weakly connected domination in graphs ⋮ A special case of Hadwiger's conjecture ⋮ New analysis and computational study for the planar connected dominating set problem ⋮ Colouring perfect graphs with bounded clique number ⋮ Making a dominating set of a graph connected ⋮ On the Hadwiger's conjecture for graph products ⋮ Boundary classes for graph problems involving non-local properties ⋮ Some inequalities about connected domination number ⋮ Bounds on the connected \(k\)-domination number in graphs ⋮ A width parameter useful for chordal and co-comparability graphs ⋮ Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity ⋮ The Price of Connectivity for Cycle Transversals ⋮ Clique immersions and independence number ⋮ Clique minors in graphs with a forbidden subgraph ⋮ The price of connectivity for dominating set: upper bounds and complexity ⋮ Connected domination in random graphs ⋮ Totally odd immersions in line graphs ⋮ 2-connected graphs with small 2-connected dominating sets. ⋮ Recent progress towards Hadwiger's conjecture ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ On the Structure of Graphs Vertex Critical with Respect to Connected Domination ⋮ Large minors in graphs with given independence number ⋮ Breaking the degeneracy barrier for coloring graphs with no \(K_t\) minor ⋮ Algorithms for graphs with small octopus ⋮ Domination and total domination on asteroidal triple-free graphs ⋮ Forcing clique immersions through chromatic number ⋮ \(k\)-domination and \(k\)-independence in graphs: A survey ⋮ Triameter of graphs ⋮ Price of connectivity for the vertex cover problem and the dominating set problem: conjectures and investigation of critical graphs ⋮ Some remarks on the odd Hadwiger's conjecture ⋮ The price of connectivity for feedback vertex set ⋮ On Hadwiger's number---A problem of the Nordhaus-Gaddum type ⋮ A basic elementary extension of the Duchet-Meyniel theorem ⋮ The limit case of a domination property ⋮ Hadwiger numbers and over-dominating colourings ⋮ Clique immersions in graphs of independence number two with certain forbidden subgraphs ⋮ On the doubly connected domination number of a graph ⋮ 2-edge connected dominating sets and 2-connected dominating sets of a graph ⋮ The price of connectivity for cycle transversals ⋮ Connected Domination ⋮ Short proofs of some extremal results III ⋮ On the complement graph and defensive \(k\)-alliances ⋮ Clique minors in claw-free graphs ⋮ Fractional colouring and Hadwiger's conjecture ⋮ Clique minors in graphs and their complements ⋮ Improvements of the theorem of Duchet and Meyniel on Hadwiger's conjecture ⋮ Connectivity and choosability of graphs with no \(K_t\) minor ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters
This page was built for publication: On Hadwiger's Number and the Stability Number
