The following pages link to (Q3999465):
Displaying 5 items.
- \(k\)-domination and \(k\)-independence in graphs: A survey (Q659765) (← links)
- On graphs with equal domination and covering numbers (Q1329822) (← links)
- Coloring edges of self-complementary graphs (Q1373172) (← links)
- Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments (Q1827718) (← links)
- The Petersen graph is not 1-factorable: postscript to `The Petersen graph is not 3-edge-colorable -- a new proof' [Discrete Math. 268 (2003) 325--326] (Q1886365) (← links)