Constrained-Path Labellings on Graphs of Bounded Clique-Width

By Courcelle Bruno  

Theory of Computing Systems, Vol. 47, Iss. 2, 2010-08 ,pp. : 531-567

Springer Publishing Company

Access to resources Recommend Favorite

Recognition Algorithms for Orders of Small Width and Graphs of Small Dilworth Number

By Felsner Stefan   Raghavan Vijay   Spinrad Jeremy  

Order, Vol. 20, Iss. 4, 2003-11 ,pp. : 351-364

Springer Publishing Company

Access to resources Recommend Favorite

On maximum matchings in cubic graphs with a bounded number of bridge-covering paths

By  

Bulletin of the Australian Mathematical Society, Vol. 36, Iss. 3, 1987-12 ,pp. : 441-447

Cambridge University Press

Access to resources Recommend Favorite

On the Maximum Number of Edges in Topological Graphs with no Four Pairwise Crossing Edges

By Ackerman Eyal  

Discrete & Computational Geometry, Vol. 41, Iss. 3, 2009-04 ,pp. : 365-375

Springer Publishing Company

Access to resources Recommend Favorite

Bounded width problems and algebras

By Larose Benoit  

algebra universalis, Vol. 56, Iss. 3-4, 2007-06 ,pp. : 439-466

Springer Publishing Company

Access to resources Recommend Favorite