Ars Combinatoria, Volume 76Department of Combinatorics and Optimization, University of Waterloo., 2005 - Combinatorial analysis |
Contents
The non planar vertex deletion of CnxCm by C F X de Mendonca | 3 |
A Note on Neighborhood Unions and Independent Cycles | 29 |
Two sufficient conditions for a graph to be type 1 by JianLiang | 47 |
Copyright | |
17 other sections not shown
Other editions - View all
Common terms and phrases
12...k and ending 5-regular 6-cycle system a₁ adjacent algorithm assume B₁ bijection bipartite graph bricks characteristic polynomial chromatic number chromatic sum circulant digraph Combinatorial conjecture consider contradiction Corollary cycle defining set denote the number Discrete Math disjoint edges element equipartition exactly exists a 6-cycle F(a² Figure function G contains graph G Graph Theory Hall t-chromatic hamiltonian circuit Hence hypergraph implies induced subgraph integers integral graphs isolated vertices isomorphic labeling least Lemma Let G line graph list colouring LKSB(G Mathematics maximal clique maximal clique irreducible maximum degree meridian mod 3-orientable NP-complete obtain outerplanar graph pair path planar graph poset Proof of Theorem Proposition prove pseudograceful regular graph satisfies SB-graph sequence Stirling numbers subset sum of colors Suppose three lists toroidal drawing total chromatic total colouring transversal trees V₁ vertex deletion vertex set w₁ weighted graph