Jiang Yongsong

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Let (G) be the domination number of graph G, thus a graph G is k-edge-critical if (G) ¼ k; and for every nonadjacent pair of vertices u and v, (G þ uv) ¼ k À 1. In Chapter 16 of the book ''Domination in Graphs— Advanced Topics,'' D. Sumner cites a conjecture of E. Wojcicka under the form ''3-connected 4-critical graphs are Hamiltonian and perhaps, in(More)
  • 1