Signpost systems and spanning trees of graphs

ISSN： 0011-4642

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

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On signpost systems and connected graphs

By Nebesky Ladislav

Czechoslovak Mathematical Journal, Vol. 55, Iss. 2, 2005-06 ,pp. : 283-293

Springer Publishing Company

Access to resources Recommend Favorite

Packing algorithms for arborescences (and spanning trees) in capacitated graphs

By Gabow H.N. Manu K.S.

Mathematical Programming, Vol. 82, Iss. 1, 1998-06 ,pp. : 83-109

Elsevier

Access to resources Recommend Favorite

Edge‐Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs

JOURNAL OF GRAPH THEORY, Vol. 81, Iss. 1, 2016-01 ,pp. : 16-29

John Wiley & Sons Inc

Access to resources Recommend Favorite

Rainbow spanning trees in complete graphs colored by one‐factorizations

JOURNAL OF GRAPH THEORY, Vol. 87, Iss. 3, 2018-03 ,pp. : 333-346

John Wiley & Sons Inc

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