Documents A Characterization of Certain Families of Graphs Moussi

A characterization of certain families of well-covered circulant graphs by Rania Moussi A Thesis Submitted to Saint Mary’s University, Halifax, Nova Scotia in Partial Fulfillment…

Documents On the Complexity of K-Dimensional-Matching Elad Hazan, Muli Safra & Oded Schwartz.

Slide 1 On the Complexity of K-Dimensional-Matching Elad Hazan, Muli Safra & Oded Schwartz Slide 2 Maximal Matching in Bipartite Graphs Slide 3 Easy problem: in P Maximal…

Documents The Ryjacek Closure and a Forbidden Subgraph Akira Saito (Nihon University, Japan) Liming Xiong...

Domination in Graphs with Large Girth The Ryjacek Closure and a Forbidden Subgraph Akira Saito (Nihon University, Japan) Liming Xiong (Beijing Institute of Technology, China)…

Documents On-line list colouring of graphs

On-line list colouring of graphs Xuding Zhu Zhejiang Normal University Suppose G is a graph A list assignment L assigns to each vertex x a set L(x) of permissible colours.…