Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees

By Halldórsson M.M.   Kortsarz G.  

Journal of Algorithms, Vol. 42, Iss. 2, 2002-02 ,pp. : 334-366

Academic Press

Access to resources Recommend Favorite

The Number of Spanning Trees in K_n-Complements of Quasi-Threshold Graphs

By Nikolopoulos Stavros D.   Papadopoulos Charis  

Graphs and Combinatorics, Vol. 20, Iss. 3, 2004-08 ,pp. : 383-397

Springer Publishing Company

Access to resources Recommend Favorite

Covering directed graphs by in-trees

By Kamiyama Naoyuki   Katoh Naoki  

Journal of Combinatorial Optimization, Vol. 21, Iss. 1, 2011-01 ,pp. : 2-18

Springer Publishing Company

Access to resources Recommend Favorite

Signpost systems and spanning trees of graphs

By Nebeský Ladislav  

Czechoslovak Mathematical Journal, Vol. 56, Iss. 3, 2006-09 ,pp. : 885-893

Springer Publishing Company

Access to resources Recommend Favorite

Independence and k-domination in graphs

By Hansberg Adriana   Meierling Dirk   Volkmann Lutz  

International Journal of Computer Mathematics, Vol. 88, Iss. 5, 2011-03 ,pp. : 905-915

Taylor & Francis Ltd

Access to resources Recommend Favorite