A Characterization of Certain Families of Graphs Moussi
On the Complexity of K-Dimensional-Matching Elad Hazan, Muli Safra & Oded Schwartz.
The Ryjacek Closure and a Forbidden Subgraph Akira Saito (Nihon University, Japan) Liming Xiong (Beijing Institute of Technology, China)
On-line list colouring of graphs
