18 pages matching adjacent in this book
Results 1-3 of 18
What people are saying - Write a review
We haven't found any reviews in the usual places.
On Powers of Chordal Graphs And Their Colorings
On the Enumeration of Abelian KComplete Mappings
7 other sections not shown
acyclic adjacent antipodal coloring array bipartite graph blocks bound graphs cells chordal graphs chromatic number chromatic polynomial column combinatorial complement domination complete graph complete mapping Computer connected graph consecutive cuts consider construction contains Corollary corresponding cycle DCMST DCMST(4 defined Definition denote diameter digraph dim(G distance edge elements exactly example feedback arc set finite framework given graph G greedy algorithm green squares grid graphs GWhD(6s Hence input integer interval graph iteration latin square Lemma Let G Math Mathematics matrix maximum number minimum feedback arc multicast node number of vertices O-array obtained optimal outerplanar graph packet pair partition path permutations PIFs planar graphs planar Steinhaus graphs player polyominoes positive integer problem Proof proper coloring RBIBD satisfy Skolem sequences spanning forest spanning tree starters Steiner trees subgraph subset Table Theorem tournament triangles triple triple-chain upper bound vector vertex set Whist