Pages that link to "Item:Q2809944"
From MaRDI portal
The following pages link to A characterization of independent domination critical graphs with a cutvertex (Q2809944):
Displaying 6 items.
- A polynomial algorithm for the extendability problem in bipartite graphs (Q293170) (← links)
- Some toughness results in independent domination critical graphs (Q891316) (← links)
- On independent domination critical graphs and \(k\)-factor critical. (Q2828983) (← links)
- Graph Critical With Respect To Independent Domination (Q2831787) (← links)
- Color-critical graphs with independent cutset (Q3804719) (← links)
- A characterization of 3-<i>i</i>-critical graphs of connectivity two (Q5236122) (← links)