Pages that link to "Item:Q2868499"
From MaRDI portal
The following pages link to Total dominations in \(P_6\)-free graphs (Q2868499):
Displaying 8 items.
- Characterization of \(P_{6}\)-free graphs (Q881583) (← links)
- A new characterization of \(P_{6}\)-free graphs (Q972332) (← links)
- A new upper bound on the total domination number in graphs with minimum degree six (Q2043347) (← links)
- On the chromatic number of (\(P_6\), diamond)-free graphs (Q2413634) (← links)
- Deploying Robots With Two Sensors in<i>K</i><sub>1, 6</sub>-Free Graphs (Q3188660) (← links)
- Irredundance perfect andP6-free graphs (Q4242953) (← links)
- Independence and Efficient Domination on <i>P</i> <sub>6</sub> -free Graphs (Q4554948) (← links)
- New Polynomial Case for Efficient Domination in P 6-free Graphs (Q5174951) (← links)
