Optimal Ear Decompositions of Matching Covered Graphs and Bases for the Matching Lattice-Reference-Cited by-同舟云学术

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

Published:2002-05 Issue:1 Volume:85 Page:59-93
ISSN:0095-8956
Container-title:Journal of Combinatorial Theory, Series B
language:en
Short-container-title:Journal of Combinatorial Theory, Series B

Author:

de Carvalho Marcelo H.,Lucchesi Cláudio L.,Murty U.S.R.

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference14 articles.

1. Decomposição Ótima em Orelhas para Grafos Matching Covered;de Carvalho,1997

2. Ear decompositions of matching covered graphs;de Carvalho;Combinatorica,1999

3. M. H. de Carvalho, C. L. Lucchesi, and, U. S. R. Murty, On a conjecture of Lovász concerning bricks, I. The characteristic of a matching covered graph, J. Combin. Theory Ser. B.

4. M. H. de Carvalho, C. L. Lucchesi, and, U. S. R. Murty, On a conjecture of Lovász concerning bricks, II. Bricks of finite characteristic, J. Combin. Theory, Ser. B.

5. Brick decomposition and the matching rank of graphs;Edmonds;Combinatorica,1982

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Some snarks are worse than others;European Journal of Combinatorics;2024-03

2. All Pairs of Pentagons in Leapfrog Fullerenes Are Nice;Mathematics;2020-12-01

3. Nice pairs of odd cycles in fullerene graphs;Journal of Mathematical Chemistry;2020-09-16

4. Generating simple near‐bipartite bricks;Journal of Graph Theory;2020-05-20

5. A characterization of nonfeasible sets in matching covered graphs;Journal of Graph Theory;2020-04-16