Search Results - "Kothari, Nishad"

Generating near‐bipartite bricks by Kothari, Nishad

“…Carvalho, Lucchesi and Murty (2006, How to build a brick, Discrete Math., 306, 2383‐2410) gave a generation procedure for bricks. In particular, they showed…”
Get full text

Approximation algorithms for digraph width parameters by Kintali, Shiva, Kothari, Nishad, Kumar, Akash

“…Several problems that are NP-hard on general graphs are efficiently solvable on graphs with bounded treewidth. Efforts have been made to generalize treewidth…”
Get full text

Generating simple near‐bipartite bricks by Kothari, Nishad, Carvalho, Marcelo H.

“…A brick is a 3‐connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. A brick G is near‐bipartite…”
Get full text

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

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

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

Minimal braces by Fabres, Phelipe A., Kothari, Nishad, Carvalho, Marcelo H.

“…McCuaig proved a generation theorem for braces, and used it as the principal induction tool to obtain a structural characterization of Pfaffian braces. A brace…”
Get full text

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

“…Lovász (1987) proved that every matching covered graph $G$ may be uniquely decomposed into a list of bricks (nonbipartite) and braces (bipartite); we let…”
Get full text

theta$-free matching covered graphs by Joshi, Rohinee, Kothari, Nishad

“…A nontrivial connected graph is matching covered if each edge belongs to some perfect matching. For most problems pertaining to perfect matchings, one may…”
Get full text

Generating Near-Bipartite Bricks by Kothari, Nishad

“…A $3$-connected graph $G$ is a brick if, for any two vertices $u$ and $v$, the graph $G-\{u,v\}$ has a perfect matching. Deleting an edge $e$ from a brick $G$…”
Get full text

Equivalence classes, solitary patterns and cubic graphs by Narayana, D. V. V, Gohokar, Kalyani, Kothari, Nishad

“…A nontrivial connected graph is matching covered if each edge belongs to some perfect matching. There is extensive theory on these graphs; see Lucchesi and…”
Get full text

Extremal minimal bipartite matching covered graphs by Mallik, Amit Kumar, Diwan, Ajit A, Kothari, Nishad

“…A connected graph, on four or more vertices, is matching covered if every edge is present in some perfect matching. An ear decomposition theorem (similar to…”
Get full text

Planar Cycle-Extendable Graphs by Dalwadi, Aditya Y, Pause, Kapil R Shenvi, Diwan, Ajit A, Kothari, Nishad

“…For most problems pertaining to perfect matchings, one may restrict attention to matching covered graphs -- that is, connected nontrivial graphs with the…”
Get full text

Minimal Braces by Fabres, Phelipe A, Kothari, Nishad, de Carvalho, Marcelo H

“…McCuaig (2001, Brace Generation, J. Graph Theory 38: 124-169) proved a generation theorem for braces, and used it as the principal induction tool to obtain a…”
Get full text

Equivalence classes in matching covered graphs by Lu, Fuliang, Kothari, Nishad, Feng, Xing, Zhang, Lianzhu

“…A connected graph $G$, of order two or more, is matching covered if each edge lies in some \pema. The tight cut decomposition of a matching covered graph $G$…”
Get full text

Generating simple near-bipartite bricks by Kothari, Nishad, de Carvalho, Marcelo H

“…A brick is a $3$-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. A brick $G$ is…”
Get full text

Birkhoff-von Neumann Graphs that are PM-compact by de Carvalho, Marcelo H, Kothari, Nishad, Wang, Xiumei, Lin, Yixun

“…A well-studied geometric object in combinatorial optimization is the perfect matching polytope of a graph $G$. In any investigation concerning the perfect…”
Get full text

On essentially 4-edge-connected cubic bricks by Kothari, Nishad, de Carvalho, Marcelo H, Lucchesi, Cláudio L, Little, Charles H. C

“…Lov\'asz (1987) proved that every matching covered graph $G$ may be uniquely decomposed into a list of bricks (nonbipartite) and braces (bipartite); we let…”
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

Approximation Algorithms for Digraph Width Parameters by Kintali, Shiva, Kothari, Nishad, Kumar, Akash

“…Several problems that are NP-hard on general graphs are efficiently solvable on graphs with bounded treewidth. Efforts have been made to generalize treewidth…”
Get full text