An algorithm for packing non-zero A -paths in group-labelled graphs

ISSN： 0209-9683

Source： Combinatorica, Vol.28, Iss.2, 2008-03, pp. : 145-161

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

Packing Non-Zero A-Paths In Group-Labelled Graphs

By Chudnovsky Maria Geelen Jim Gerards Bert Goddyn Luis Lohman Michael Seymour Paul

Combinatorica, Vol. 26, Iss. 5, 2006-10 ,pp. : 521-532

Springer Publishing Company

Access to resources Recommend Favorite

Packing Non-Returning A -Paths*

By Pap† Gyula

Combinatorica, Vol. 27, Iss. 2, 2007-03 ,pp. : 247-251

Springer Publishing Company

Access to resources Recommend Favorite

Paths in graphs

By Bollobás B. Sarkar A.

Studia Scientiarum Mathematicarum Hungarica, Vol. 38, Iss. 1-4, 2001-12 ,pp. : 115-137

Akademiai Kiado

Access to resources Recommend Favorite

A Polynomial-Time Algorithm for Finding Regular Simple Paths in Outerplanar Graphs

By Nedev Z.P. Wood P.T.

Journal of Algorithms, Vol. 35, Iss. 2, 2000-05 ,pp. : 235-259

Academic Press

Access to resources Recommend Favorite

Entire functions sharing a non-zero value with their derivatives

By Lahiri Indrajit

Lobachevskii Journal of Mathematics, Vol. 32, Iss. 3, 2011-07 ,pp. : 213-219

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite