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

K4-free and C6¯-free Planar Matching Covered Graphs by Kothari, Nishad, Murty, U. S. R.

“…A bi‐subdivision of a graph J is a graph H obtained from J by subdividing each of its edges by inserting an even number of vertices. A matching covered…”
Get full text

K4-free and C 6 ¯-free Planar Matching Covered Graphs by Kothari, Nishad, Murty, U S R

“…A bi-subdivision of a graph J is a graph H obtained from J by subdividing each of its edges by inserting an even number of vertices. A matching covered…”
Get full text

K 4 ‐free and ‐free Planar Matching Covered Graphs by Kothari, Nishad, Murty, U. S. R.

“…A bi‐subdivision of a graph J is a graph H obtained from J by subdividing each of its edges by inserting an even number of vertices. A matching covered…”
Get full text

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

“…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

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

“…The bicontraction of a vertex $v$ of degree two in a graph, with precisely two neighbours $v_1$ and $v_2$, consists of shrinking the set $\{v_1,v,v_2\}$ to a…”
Get full text

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

“…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

How to build a brick: Creation and recreation: a tribute to the memory of Claude Berge by DE CARVALHO, Marcelo H, LUCCHESI, Claudio L, MURTY, U. S. R

Get full text

Graphs with independent perfect matchings by de Carvalho, Marcelo H., Lucchesi, Cláudio L., Murty, U. S. R.

“…A graph with at least two vertices is matching covered if it is connected and each edge lies in some perfect matching. A matching covered graph G is extremal…”
Get full text

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

“…A cut $C:=\partial(X)$ of a matching covered graph $G$ is a separating cut if both its $C$-contractions $G/X$ and $G/\overline{X}$ are also matching covered. A…”
Get full text

Ear Decompositions of Matching Covered Graphs by Carvalho, Marcelo H., Lucchesi, Cláudio L., Murty, U. S. R.

Get full text

How Many Magic Configurations are There? by Murty, U. S. R.

Get full text

An Application of Rado's Theorem to Disjoint Matchings in Bipartite Graphs by Murty, U. S. R.

Get full text

On Critical Graphs of Diameter 2 by Murty, U. S. R.

Get full text

On Critical Graphs of Diameter 2 by Murty, U. S. R.

Get full text

How Many Magic Configurations are There? by Murty, U. S. R.

Get full text

Matroids with sylvester property by Murty, U. S. R.

Get full text

Matroids with Sylvester property by Murty, U. S. R.

Get full text

On Accessibility in Graphs by Vijayan, K., Murty, U. S. R.

“…The concepts of k-accessibility and order of accessibility on a graph are introduced. Further, the problem of constructing a graph, with economic use of edges,…”
Get full text

On some extremal graphs by Murty, U. S. R.

Get full text

Graph Theory with Applications by Kay, E.

Get full text