Claudio L. Lucchesi

Lianzhu Zhang

J. Comb. Theory B, 2021

2020

On Essentially 4-Edge-Connected Cubic Bricks.

[BibT_eX]

[DOI]

Nishad Kothari

Charles H. C. Little

Electron. J. Comb., 2020

2018

On Two Unsolved Problems Concerning Matching Covered Graphs.

[BibT_eX]

[DOI]

Nishad Kothari

SIAM J. Discret. Math., 2018

2017

Propagating Maximum Capacities for Recommendation.

[BibT_eX]

[DOI]

Ahcène Boubekki

Ulf Brefeld

Wolfgang Stille

Proceedings of the KI 2017: Advances in Artificial Intelligence, 2017

2015

Hypohamiltonian Snarks Have a 5-Flow.

[BibT_eX]

[DOI]

Breno Lima de Freitas

Electron. Notes Discret. Math., 2015

Thin Edges in Braces.

[BibT_eX]

[DOI]

Electron. J. Comb., 2015

2014

3-Flows and Combs.

[BibT_eX]

[DOI]

J. Graph Theory, 2014

2013

On the Number of Perfect Matchings in a Bipartite Graph.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

Snarks and Flow-Critical Graphs.

[BibT_eX]

[DOI]

Lissa Pesci

Electron. Notes Discret. Math., 2013

A characterization of PM-compact bipartite and near-bipartite graphs.

[BibT_eX]

[DOI]

Xiumei Wang

Yixun Lin

G. Sanjith

Charles H. C. Little

Discret. Math., 2013

2012

A generalization of Little's Theorem on Pfaffian orientations.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2012

2011

Matching signatures and Pfaffian graphs.

[BibT_eX]

[DOI]

Discret. Math., 2011

2010

A lower bound on the number of removable ears of 1-extendable graphs.

[BibT_eX]

[DOI]

Shaohui Zhai

Xiaofeng Guo

Discret. Math., 2010

Recognizing near-bipartite Pfaffian graphs in polynomial time.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

2009

On the Pfaffian Number of Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

2008

Flow-Critical Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2008

A Polynomial Time Algorithm for Recognizing Near-Bipartite Pfaffian Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2008

2006

A pair of forbidden subgraphs and perfect matchings.

[BibT_eX]

[DOI]

Shinya Fujita

Ken-ichi Kawarabayashi

Katsuhiro Ota

Michael D. Plummer

Akira Saito

J. Comb. Theory B, 2006

How to build a brick.

[BibT_eX]

[DOI]

Discret. Math., 2006

2005

Graphs with independent perfect matchings.

[BibT_eX]

[DOI]

J. Graph Theory, 2005

On the number of dissimilar pfaffian orientations of graphs.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2005

2004

The perfect matching polytope and solid bricks.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2004

2002

On a Conjecture of Lovász Concerning Bricks: II. Bricks of Finite Characteristic.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2002

On a Conjecture of Lovász Concerning Bricks: I. The Characteristic of a Matching Covered Graph.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2002

Optimal Ear Decompositions of Matching Covered Graphs and Bases for the Matching Lattice.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2002

2001

Contributions of Jayme Luiz Szwarcfiter to graph theory and computer science.

[BibT_eX]

J. Braz. Comput. Soc., 2001

1999

Ear Decompositions of Matching Covered Graphs.

[BibT_eX]

[DOI]

Comb., 1999

1998

On clique-complete graphs.

[BibT_eX]

[DOI]

Célia Picinin de Mello

Jayme Luiz Szwarcfiter

Discret. Math., 1998

1997

On the Connection between the Undirected and the Acyclic Directed Two Disjoint Paths Problem.

[BibT_eX]

Maria Cecilia M. T. Giglio

Ars Comb., 1997

Minimax relations for T-join packing problems.

[BibT_eX]

[DOI]

Jaime Cohen

Proceedings of the Fifth Israel Symposium on Theory of Computing and Systems, 1997

1996

Matching Covered Graphs and Subdivisions of<i>K</i><sub>4</sub>and[formula].

[BibT_eX]

[DOI]

J. Comb. Theory B, 1996

1993

Applications of Finite Automata Representing Large Vocabularies.

[BibT_eX]

[DOI]

Tomasz Kowaltowski

Softw. Pract. Exp., 1993

1983

Superfluous paths in strong digraphs.

[BibT_eX]

[DOI]

Jeffrey A. Ross

Discret. Math., 1983

1978

Candidate Keys for Relations.

[BibT_eX]

[DOI]