Congressus Numerantium, المجلد 157

a-dominating set adjacent affinely equivalent arcs B-arrays binary number bipartite graph blocks channel assignment characterization chordal bipartite chordal graph clique-size column complete graph compressed tournament Computer Congressus Numerantium connected graph Corollary defined deleted denote digraph division ring dom(T dominating set domination graph enclaveless set Genetic Algorithms graph G Graph Theory hamiltonian coloring hc(G held by II(D heuristic IBGs induced P3 induced subgraph integer intersection graph interval graphs isomorphic labeled Lemma length Let G lines of slopes matrix maximal maximum median point minimal minimum number Minimum Spanning Tree multicast multicast tree networks O(n² obtains the contradiction odd cycle oval P-set pair parallel classes parameters pendant perfect matching permutation code Proposition 2.2 Prüfer code secants of slope self-clique graph service colouring set of secants simplicial slope b/a yield Spanning Tree MST standard position subgraph Suppose Theorem 1.1 totally matchable vertex set vertices of degree