Multimatroids III. Tightness and Fundamental Graphs

Publisher： Elsevier

ISSN： 0195-6698

Source： European Journal of Combinatorics, Vol.22, Iss.5, 2001-07, pp. : 657-677

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 isomorphisms of connected Cayley graphs, III

Bulletin of the Australian Mathematical Society, Vol. 58, Iss. 1, 1998-08 ,pp. : 137-145

Cambridge University Press

Access to resources Recommend Favorite

$C^{\ast }$ -algebras of labelled graphs III— $K$ -theory computations

Ergodic Theory and Dynamical Systems, Vol. 37, Iss. 2, 2015-10 ,pp. : 337-368

Cambridge University Press

Access to resources Recommend Favorite

Tightness in subset bounds for coherent configurations

By Hobart Sylvia Williford Jason

Journal of Algebraic Combinatorics, Vol. 39, Iss. 3, 2014-05 ,pp. : 647-658

Springer Publishing Company

Access to resources Recommend Favorite

Concordance Graphs

By Fishburn P. Monjardet B.

European Journal of Combinatorics, Vol. 21, Iss. 4, 2000-05 ,pp. : 461-471

Elsevier

Access to resources Recommend Favorite

On Compact Graphs

By Wang Ping Li Jiong

Acta Mathematica Sinica, Vol. 21, Iss. 5, 2005-10 ,pp. : 1087-1092

Springer Publishing Company

Access to resources Recommend Favorite