What people are saying - Write a review
We haven't found any reviews in the usual places.
G A Asmerom
Bauer E Schmeichel and H J Veldman
K S Bagga L W Beineke and B N Varma
43 other sections not shown
Other editions - View all
2-connected adjacent algorithm assume average genus bipartite graph bull-free Cayley graph chromatic number classes of graphs clique color Combinatorial complete bipartite graph complete graph components Computer conjecture connected graph construct contradiction Corollary cubic graph cycle defined denote diams(G digraph Discrete Math distance dominating set domination number edges of G elements embedding Euler tour example exists fc-spectrum G contains given graph G Graph Theory grid graphs hamiltonian Hedetniemi Hence homeomorphic imbedding induced induced subgraph irredundance isomorphic labeled least Lemma length Let G line graphs maximal maximum minimal minimum move drum n-dominating nodes number of edges number of vertices obtained ordinary points outerplanar graph partition perfect graphs polynomial positive integer problem processor proved result sequence set of vertices shown in Figure signed dominating spanning tree starter set subgraph of G subset Suppose triangle tube udev vertex set vertices of degree vertices of G