The following pages link to Adriana Hansberg (Q260017):
Displaying 48 items.
- Regular independent sets (Q260019) (← links)
- Isolation in graphs (Q324891) (← links)
- (Q423959) (redirect page) (← links)
- Restricted arc-connectivity of generalized \(p\)-cycles (Q423961) (← links)
- New results on 3-domination critical graphs (Q443927) (← links)
- Fair domination in graphs (Q449132) (← links)
- Degrees in oriented hypergraphs and Ramsey \(p\)-chromatic number (Q456338) (← links)
- Total domination edge critical graphs with total domination number three and many dominating pairs (Q497305) (← links)
- Bounds on the connected \(k\)-domination number in graphs (Q608255) (← links)
- \(k\)-domination and \(k\)-independence in graphs: A survey (Q659765) (← links)
- On the geodetic and geodetic domination numbers of a graph (Q982620) (← links)
- 2-domination subdivision number of graphs (Q1011881) (← links)
- Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number (Q1028141) (← links)
- Zero-sum subsequences in bounded-sum \(\{-1,1\}\)-sequences (Q1621429) (← links)
- New approach to the \(k\)-independence number of a graph (Q1953418) (← links)
- Zero-sum \(K_m\) over \(\mathbb{Z}\) and the story of \(K_4\) (Q2000579) (← links)
- On zero-sum spanning trees and zero-sum connectivity (Q2073300) (← links)
- Strengthening the Murty-Simon conjecture on diameter 2 critical graphs (Q2324502) (← links)
- Locating-dominating sets and identifying codes in graphs of girth at least 5 (Q2344817) (← links)
- Distance domination and distance irredundance in graphs (Q2372879) (← links)
- On \(k\)-domination and \(j\)-independence in graphs (Q2446328) (← links)
- Partitions of graphs into small and large sets (Q2446835) (← links)
- On graphs with equal domination and 2-domination numbers (Q2483412) (← links)
- On the balanceability of some graph classes (Q2659061) (← links)
- The balancing number and generalized balancing number of some graph classes (Q2692189) (← links)
- (Q2811813) (← links)
- (Q2870947) (← links)
- (Q2895373) (← links)
- (Q2918564) (← links)
- Independence and<i>k</i>-domination in graphs (Q2995488) (← links)
- A general method in the theory of domination in graphs (Q3066944) (← links)
- (Q3099537) (← links)
- Multiple Domination (Q3384609) (← links)
- Onk-domination and minimum degree in graphs (Q3539928) (← links)
- (Q3581670) (← links)
- (Q3620566) (← links)
- (Q3635525) (← links)
- (Q3635575) (← links)
- Partial domination - the isolation number of a graph (Q5162046) (← links)
- Directed domination in oriented hypergraphs (Q5242948) (← links)
- Claw-free graphs with equal 2-domination and domination numbers (Q5279559) (← links)
- On the super‐restricted arc‐connectivity of <i>s</i> ‐geodetic digraphs (Q5326776) (← links)
- Characterization of block graphs with equal 2-domination number and domination number plus one (Q5444059) (← links)
- (Q5449168) (← links)
- Unavoidable chromatic patterns in 2‐colorings of the complete graph (Q6055932) (← links)
- Recent developments on unavoidable patterns in 2-colorings of the complete graph (Q6621176) (← links)
- Unavoidable patterns in $2$-colorings of the complete bipartite graph (Q6736235) (← links)
- Graphs with constant links and induced Turán numbers (Q6745207) (← links)
