The following pages link to (Q4228229):
Displayed 30 items.
- A maximum degree theorem for diameter-2-critical graphs (Q403217) (← links)
- A characterization of diameter-2-critical graphs with no antihole of length four (Q424139) (← links)
- A characterization of diameter-2-critical graphs whose complements are diamond-free (Q442211) (← links)
- Total domination edge critical graphs with total domination number three and many dominating pairs (Q497305) (← links)
- Progress on the Murty-Simon conjecture on diameter-2 critical graphs: a survey (Q498431) (← links)
- On the existence of \(k\)-partite or \(K_p\)-free total domination edge-critical graphs (Q539864) (← links)
- Total domination critical and stable graphs upon edge removal (Q602674) (← links)
- Total domination stable graphs upon edge addition (Q607001) (← links)
- Total domination changing and stable graphs upon vertex removal (Q642980) (← links)
- On a conjecture of Murty and Simon on diameter two critical graphs. II. (Q658055) (← links)
- The maximum diameter of total domination edge-critical graphs (Q658066) (← links)
- Perfect matchings in total domination critical graphs (Q659733) (← links)
- A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free (Q666001) (← links)
- Minimum 2-tuple dominating set of an interval graph (Q666518) (← links)
- Properties of total domination edge-critical graphs (Q968121) (← links)
- A survey of selected recent results on total domination in graphs (Q998491) (← links)
- Total edge critical graphs with leaves (Q1759387) (← links)
- Connected domination critical graphs. (Q1764547) (← links)
- Edge lifting and total domination in graphs (Q1945695) (← links)
- Hamiltonicity of \(3_t\)EC graphs with \(\alpha=\kappa +1\) (Q2036021) (← links)
- On a conjecture of Murty and Simon on diameter 2-critical graphs (Q2275449) (← links)
- Total Roman domination edge-critical graphs (Q2292609) (← links)
- Strengthening the Murty-Simon conjecture on diameter 2 critical graphs (Q2324502) (← links)
- A characterization of \(P_5\)-free, diameter-2-critical graphs (Q2449064) (← links)
- Minimum 2-tuple dominating set of permutation graphs (Q2511387) (← links)
- Connected domination critical graphs with respect to relative complements (Q3599877) (← links)
- An optimal algorithm to find minimum k-hop dominating set of interval graphs (Q4634287) (← links)
- An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs (Q4985488) (← links)
- Total Roman Domination Edge-Supercritical and Edge-Removal-Supercritical Graphs (Q5139714) (← links)
- All My Favorite Conjectures Are Critical (Q5506776) (← links)