The following pages link to Jean E. Dunbar (Q1356463):
Displaying 22 items.
- Finite nets of dimension d (Q599060) (← links)
- (Q878615) (redirect page) (← links)
- The path partition conjecture is true for claw-free graphs (Q878616) (← links)
- A linear bound towards the traceability conjecture (Q895060) (← links)
- Partial geometry of dimension three (Q1245223) (← links)
- Minus domination in graphs (Q1297430) (← links)
- Gallai-type theorems and domination parameters (Q1356464) (← links)
- On weakly connected domination in graphs (Q1356466) (← links)
- Path partitions and \(P_{n}\)-free sets (Q1763347) (← links)
- Nearly perfect sets in graphs (Q1842165) (← links)
- Minus domination in regular graphs (Q1910590) (← links)
- The algorithmic complexity of minus domination in graphs (Q1917346) (← links)
- An iterative approach to the traceability conjecture for oriented graphs (Q1953448) (← links)
- \(\alpha\)-domination (Q1969776) (← links)
- Destroying longest cycles in graphs and digraphs (Q2345615) (← links)
- On Saito's conjecture and the Oberly-Sumner conjectures (Q2409500) (← links)
- Broadcasts in graphs (Q2581560) (← links)
- (Q2713647) (← links)
- (Q2760993) (← links)
- Detour-saturated graphs (Q3022734) (← links)
- (Q3139286) (← links)
- The directed path partition conjecture (Q5492647) (← links)
