Classifying the Clique-Width of H-Free Bipartite Graphs
Attributed to:
Algorithmic Aspects of Graph Coloring
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1007/978-3-319-08783-2_42
Publication URI: http://dx.doi.org/10.1007/978-3-319-08783-2_42
Type: Book Chapter
Book Title: Computing and Combinatorics (2014)
Page Reference: 489-500