Author： Courcelle Bruno
Publisher： Springer Publishing Company
ISSN： 1432-4350
Source： Theory of Computing Systems, Vol.47, Iss.2, 2010-08, pp. : 531-567
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Crossing-number critical graphs have bounded path-width
By Hlineny P.
Journal of Combinatorial Theory, Series B, Vol. 88, Iss. 2, 2003-07 ,pp. :
Access to resources
Recommend
Clique coverings of graphs V: maximal-clique partitions
Bulletin of the Australian Mathematical Society, Vol. 25, Iss. 3, 1982-06 ,pp. :
Bounded width problems and algebras
algebra universalis, Vol. 56, Iss. 3-4, 2007-06 ,pp. :
The bisection width of cubic graphs
Bulletin of the Australian Mathematical Society, Vol. 39, Iss. 3, 1989-06 ,pp. :
Fractional Clique Decompositions of Dense Partite Graphs
Combinatorics, Probability & Computing, Vol. 26, Iss. 6, 2017-11 ,pp. :