Graph Theory, Combinatorics, and Applications: Proceedings of the Sixth Quadrennial International Conference on the Theory and Applications of Graphs, Western Michigan University, Volume 1Y. Alavi |
Contents
T Asano | 9 |
K S Bagga and F W Owens | 19 |
K S Bagga L W Beineke M J Lipman and R E Pippert | 30 |
Copyright | |
25 other sections not shown
Common terms and phrases
2-connected a₁ adjacency matrix adjacent algorithm assume bipartite graph block Boole coloring canonical form chromatic number Combinatorial common neighbour complete bipartite graph complete graph component Computer conjecture connected graph consider construction contradiction Corollary corresponding cubic graph cycle of length defined degree at least denote diameter Discrete Math disjoint dominating set edge-disjoint spanning trees example exists Figure G contains G₁ given graph G graph of order Graph Theory half-edge hamiltonian hamiltonian cycle hamiltonian-connected Hence imbedding induced integer intersection graph irredundant isomorphic label Lemma Let G line digraphs maximal maximum minimal minimum degree minimum number multisets node NP-complete number of edges number of vertices obtained odd cycle pair parameters partite sets Petri net planar graph positive integer problem Proof Let Proposition prove regular graphs result satisfies semicomplete digraph semiedges series-parallel graph snarks strongly connected subgraph of G subset Suppose total chromatic tournament v₁ z)-path