Search Results - "Murty, U.S.R."

  • Showing 1 - 9 results of 9
Refine Results
  1. 1
    A generalization of Littleʼs Theorem on Pfaffian orientations

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

    Published in Journal of combinatorial theory. Series B (01-11-2012)
    “…Little (1975) [12] showed that, in a certain sense, the only minimal non-Pfaffian bipartite matching covered graph is the brace K3,3. Using a stronger notion…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  2. 2
    How to build a brick

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

    Published in Discrete mathematics (06-10-2006)
    “…A graph is matching covered if it connected, has at least two vertices and each of its edges is contained in a perfect matching. A 3-connected graph G is a…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  3. 3
    Professor W.T. Tutte

    Professor W.T. Tutte by Murty, U.S.R.

    Published in Journal of combinatorial theory. Series B (01-11-2004)
    Get full text
    Journal Article
    Save to List
    Saved in:
  4. 4
    The perfect matching polytope and solid bricks

    The perfect matching polytope and solid bricks by de Carvalho, Marcelo H., Lucchesi, Cláudio L., Murty, U.S.R.

    Published in Journal of combinatorial theory. Series B (01-11-2004)
    “…The perfect matching polytope of a graph G is the convex hull of the set of incidence vectors of perfect matchings of G. Edmonds (J. Res. Nat. Bur. Standards…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  5. 5
    On a Conjecture of Lovász Concerning Bricks: I. The Characteristic of a Matching Covered Graph

    On a Conjecture of Lovász Concerning Bricks: I. The Characteristic of a Matching Covered Graph by de Carvalho, Marcelo H., Lucchesi, Cláudio L., Murty, U.S.R.

    Published in Journal of combinatorial theory. Series B (01-05-2002)
    “…In 1987, Lovász conjectured that every brick G different from K4, C6, and the Petersen graph has an edge e such that G−e is a matching covered graph with…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  6. 6
    On a Conjecture of Lovász Concerning Bricks: II. Bricks of Finite Characteristic

    On a Conjecture of Lovász Concerning Bricks: II. Bricks of Finite Characteristic by de Carvalho, Marcelo H., Lucchesi, Cláudio L., Murty, U.S.R.

    Published in Journal of combinatorial theory. Series B (01-05-2002)
    “…In (2001, J. Combin. Theory Ser. B) we established the validity of the main theorem (1.1) for solid bricks. Here, we establish the existence of suitable…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  7. 7
    Optimal Ear Decompositions of Matching Covered Graphs and Bases for the Matching Lattice

    Optimal Ear Decompositions of Matching Covered Graphs and Bases for the Matching Lattice by de Carvalho, Marcelo H., Lucchesi, Cláudio L., Murty, U.S.R.

    Published in Journal of combinatorial theory. Series B (01-05-2002)
    “…This is a sequel to our papers (M. H. de Carvalho, C. L. Lucchesi, and U. S. R. Murty, 1999, Combinatorica19, 151–174; 2001, J. Combin. Theory, Ser. B; and…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  8. 8
    On a Conjecture of Lovász Concerning Bricks

    On a Conjecture of Lovász Concerning Bricks by de Carvalho, Marcelo H., Lucchesi, Cláudio L., Murty, U.S.R.

    Published in Journal of combinatorial theory. Series B (01-05-2002)
    Get full text
    Journal Article
    Save to List
    Saved in:
  9. 9
    On a Conjecture of Lovász Concerning Bricks

    On a Conjecture of Lovász Concerning Bricks by de Carvalho, Marcelo H., Lucchesi, Cláudio L., Murty, U.S.R.

    Published in Journal of combinatorial theory. Series B (01-05-2002)
    Get full text
    Journal Article
    Save to List
    Saved in:

Search Tools: