5 citations · 17 across the 14 of their papers we have counts for
4 papers · 1 filter
Solitude patterns of -graphs via CLM's dependence relation
D. V. V. Narayana, D. Mattiolo, Kalyani Gohokar +1
Recently, Goedgebeur, Mazzuoccolo, Renders, Wolf and the second author [Cubic graphs with edges in exactly one perfect matching, J. Graph Theory 112 (2026), 276-289] proved that ev…
-free matching covered graphs: characterization and consequences
Rohinee Joshi, Santhosh Raghul, Ajit A. Diwan +1
The Ear Decomposition Theorem of Lovász & Plummer (1986) implies that every matching covered graph (MCG), except and cycles, contains (at least) one of and as a con…
Planar cycle-extendable graphs
Aditya Y Dalwadi, Kapil R Shenvi Pause, Ajit A Diwan +1
For most problems pertaining to perfect matchings, one may restrict attention to matching covered graphs - that is, connected nontrivial graphs with the property that each edge bel…
Extremal minimal bipartite matching covered graphs
Amit Kumar Mallik, Ajit A. Diwan, Nishad Kothari
A connected graph, on four or more vertices, is matching covered (aka 1-extendable) if every edge is present in some perfect matching. An ear decomposition theorem exists for bipar…