Perfect Matchings: A Theory of Matching Covered Graphs von Lucchesi, Cláudio L, Murty, U. S. R

Volltext

LATIN'98: Theoretical Informatics: Third Latin American Symposium Campinas, Brazil, April 20–24, 1998 Proceedings von Lucchesi, Cláudio L, Moura, Arnaldo V

Volltext

3-Flows and Combs von da Silva, Cândida Nunes, Lucchesi, Cláudio L.

Volltext

Laminar tight cuts in matching covered graphs von Chen, Guantao, Feng, Xing, Lu, Fuliang, Lucchesi, Cláudio L., Zhang, Lianzhu

Volltext

A characterization of PM-compact bipartite and near-bipartite graphs von Wang, Xiumei, Lin, Yixun, Carvalho, Marcelo H., Lucchesi, Cláudio L., Sanjith, G., Little, C.H.C.

Volltext

On Essentially 4-Edge-Connected Cubic Bricks von Kothari, Nishad, De Carvalho, Marcelo H., Lucchesi, Cláudio L., Little, Charles H. C.

Volltext

On Two Unsolved Problems Concerning Matching Covered Graphs von Lucchesi, Cláudio L., de Carvalho, Marcelo H., Kothari, Nishad, Murty, U. S. R.

Volltext

A lower bound on the number of removable ears of 1-extendable graphs von Zhai, Shaohui, Lucchesi, Cláudio L., Guo, Xiaofeng

Volltext

On the Number of Perfect Matchings in a Bipartite Graph von de Carvalho, Marcelo H., Lucchesi, Cláudio L., Murty, U. S. R.

Volltext

Thin Edges in Braces von Lucchesi, Cláudio L., De Carvalho, Marcelo H., Murty, U. S. R.

Volltext

A generalization of Littleʼs Theorem on Pfaffian orientations von de Carvalho, Marcelo H., Lucchesi, Cláudio L., Murty, U.S.R.

Volltext

How to build a brick von de Carvalho, Marcelo H., Lucchesi, Cláudio L., Murty, U.S.R.

Volltext

Spelling approximate repeated or common motifs using a suffix tree von Sagot, Marie -France

Volltext

Snarks and Flow-Critical Graphs von da Silva, Cândida Nunes, Pesci, Lissa, Lucchesi, Cláudio L.

Volltext

On the number of dissimilar pfaffian orientations of graphs von de Carvalho, Marcelo H., Lucchesi, Cláudio L., Murty, U. S.R.

Volltext

Hypohamiltonian Snarks Have a 5-Flow von de Freitas, Breno Lima, da Silva, Cândida Nunes, Lucchesi, Cláudio L.

Volltext

Flow-Critical Graphs von da Silva, Cândida Nunes, Lucchesi, Cláudio L.

Volltext

A linear time algorithm to recognize clustered planar graphs and its parallelization von Dahlhaus, Elias

Volltext

Intro von Lucchesi, Cláudio L, Murty, U. S. R

Volltext

Matching Covered Graphs von Lucchesi, Cláudio L., Murty, U. S. R.

Volltext