Pages that link to "Item:Q3672036"
From MaRDI portal
The following pages link to On Hadwiger's Number and the Stability Number (Q3672036):
Displayed 50 items.
- New analysis and computational study for the planar connected dominating set problem (Q328712) (← links)
- Colouring perfect graphs with bounded clique number (Q345123) (← links)
- The price of connectivity for dominating set: upper bounds and complexity (Q406321) (← links)
- The price of connectivity for feedback vertex set (Q516802) (← links)
- Bounds on the connected \(k\)-domination number in graphs (Q608255) (← links)
- Large minors in graphs with given independence number (Q641195) (← links)
- \(k\)-domination and \(k\)-independence in graphs: A survey (Q659765) (← links)
- Hadwiger numbers and over-dominating colourings (Q709310) (← links)
- The price of connectivity for cycle transversals (Q739064) (← links)
- Clique minors in claw-free graphs (Q765191) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- Connected domination number and a new invariant in graphs with independence number three (Q821330) (← links)
- Semitotal domination on AT-free graphs and circle graphs (Q831692) (← links)
- On the Hadwiger's conjecture for graph products (Q864168) (← links)
- Some remarks on the odd Hadwiger's conjecture (Q950324) (← links)
- A basic elementary extension of the Duchet-Meyniel theorem (Q960956) (← links)
- On the complement graph and defensive \(k\)-alliances (Q1026126) (← links)
- On a relationship between Hadwiger and stability numbers (Q1092928) (← links)
- Some inequalities about connected domination number (Q1126207) (← links)
- On Hadwiger's number---A problem of the Nordhaus-Gaddum type (Q1197037) (← links)
- On weakly connected domination in graphs (Q1356466) (← links)
- 2-connected graphs with small 2-connected dominating sets. (Q1402083) (← links)
- Algorithms for graphs with small octopus (Q1421464) (← links)
- Fractional colouring and Hadwiger's conjecture (Q1569032) (← links)
- Clique minors in graphs and their complements (Q1569065) (← links)
- Making a dominating set of a graph connected (Q1656909) (← links)
- A width parameter useful for chordal and co-comparability graphs (Q1680525) (← links)
- Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity (Q1680547) (← links)
- Price of connectivity for the vertex cover problem and the dominating set problem: conjectures and investigation of critical graphs (Q1733857) (← links)
- The limit case of a domination property (Q1758000) (← links)
- Domination and total domination on asteroidal triple-free graphs (Q1962038) (← links)
- Clique immersions in graphs of independence number two with certain forbidden subgraphs (Q2022152) (← links)
- Connectivity and choosability of graphs with no \(K_t\) minor (Q2099418) (← links)
- Large immersions in graphs with independence number 3 and 4 (Q2132349) (← links)
- Triameter of graphs (Q2227115) (← links)
- A special case of Hadwiger's conjecture (Q2384811) (← links)
- Boundary classes for graph problems involving non-local properties (Q2401761) (← links)
- On the doubly connected domination number of a graph (Q2501210) (← links)
- Improvements of the theorem of Duchet and Meyniel on Hadwiger's conjecture (Q2565692) (← links)
- Clique immersions and independence number (Q2674557) (← links)
- Graph theory. Abstracts from the workshop held January 2--8, 2022 (Q2693028) (← links)
- Breaking the degeneracy barrier for coloring graphs with no \(K_t\) minor (Q2700634) (← links)
- The Price of Connectivity for Cycle Transversals (Q2946410) (← links)
- On the Structure of Graphs Vertex Critical with Respect to Connected Domination (Q2971614) (← links)
- Connected Domination (Q3384607) (← links)
- Short proofs of some extremal results III (Q3386524) (← links)
- Forcing clique immersions through chromatic number (Q5892297) (← links)
- 2-edge connected dominating sets and 2-connected dominating sets of a graph (Q5963646) (← links)
- Clique minors in graphs with a forbidden subgraph (Q6074687) (← links)
- Connected domination in random graphs (Q6107484) (← links)