Menu

A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two

By Kaneko A. in (2003)

Elsevier

Abstract Access to resources Recommend Favorite

Extending partial 3-colourings in a planar graph

By DeVos M., Seymour P. in (2003)

Elsevier

Abstract Access to resources Recommend Favorite

Splitting and contractible edges in 4-connected graphs

By Saito A. in (2003)

Elsevier

Abstract Access to resources Recommend Favorite

Plane graphs with straight edges whose bounded faces are acute triangles

By Maehara H. in (2003)

Elsevier

Abstract Access to resources Recommend Favorite

On the graphic matroid parity problem

By Szigeti Z. in (2003)

Elsevier

Abstract Access to resources Recommend Favorite

On the excluded minors for the matroids of branch-width k

By Geelen J.F., Gerards A.M.H., Robertson N., Whittle G.P. in (2003)

Elsevier

Abstract Access to resources Recommend Favorite

Amalgamations of connected k-factorizations

By Hilton A.J.W., Johnson M., Rodger C.A., Wantland E.B. in (2003)

Elsevier

Abstract Access to resources Recommend Favorite

Bounded size components-partitions and transversals

By Haxell P., Szabo T., Tardos G. in (2003)

Elsevier

Abstract Access to resources Recommend Favorite

Circular chromatic number of Kneser graphs

By Hajiabolhassan H., Zhu X. in (2003)

Elsevier

Abstract Access to resources Recommend Favorite

Hamiltonian decompositions of Cayley graphs on abelian groups of even order

By Liu J. in (2003)

Elsevier

Abstract Access to resources Recommend Favorite