Santhosh Raghul

collaborators

2 papers

math.CO2026

$I^»$ -matchability in cubic graphs

Santhosh Raghul, Nishad Kothari

A vertex $v$ of a 2-connected cubic graph $G$ is $I^»$ -matchable if $G$ has a spanning subgraph in which $v$ has degree three whereas every other vertex has degree one, and we let $…

math.CO2026

$I^¸$ -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 $K_{2}$ and cycles, contains (at least) one of $I^¸$ and $K_{4}$ as a c…

I^»-matchability in cubic graphs

I^¸-free matching covered graphs: characterization and consequences

$I^»$ -matchability in cubic graphs

$I^¸$ -free matching covered graphs: characterization and consequences