M. Belavadi

activity

20192026

most citedReconfiguration of vertex colouring and forbidden induced subgraphs

6 citations · 9 across the 9 of their papers we have counts for

collaborators

9 papers

math.CO2026

Vertex-critical co-gem-free graphs

Manoj Belavadi, T. Karthick

Given a graph $G$ , let $χ (G)$ denote the chromatic number of $G$ . For $k \in N$ , a graph $G$ is $k$ - $v er t e x$ - $cr i t i c a l$ if $χ (G) = k$ and $χ (G - v) < k$ for all $v \in V (G)$ . A r…

math.CO2026

Structural description of (bull, house)-free graphs

Manoj Belavadi, Chinh T. Hoang

The bull is a graph consisting of a triangle and two pendant edges. The P_5 is the chordless path on five vertices. The house is the complement of a P_5. A graph is k-critical if i…

math.CO2025

Kempe changes in $H$ -free graphs

Manoj Belavadi, Kathie Cameron

Given a $k$ -colouring of a graph $G$ and two of the colours, a $K e m p e$ $c hain$ is a connected component of the subgraph of $G$ induced by the vertices coloured with one of these tw…

math.CO2025

Reconfiguration graph for vertex colorings for ( $P_{2}$ + $P_{3}$ , $C_{4}$ )-free graphs

M. Belavadi, T. Karthick

For a graph $G$ , let $χ (G)$ denote the chromatic number of $G$ . Given a graph $G$ , the $r eco n f i g u r a t i o n$ $g r a p h$ $f or$ $t h e$ $k$ - $co l or in g s$ of $G$ , denoted by $R_{k} (G)$ , is…

math.CO2024

Frozen colourings in $2 K_{2}$ -free graphs

Manoj Belavadi, Kathie Cameron, Elias Hildred

The \emph{reconfiguration graph of the $k$ -colourings} of a graph $G$ , denoted $R_{k} (G)$ , is the graph whose vertices are the $k$ -colourings of $G$ and two vertices of $\m…

math.CO2024

Recoloring via modular decomposition

Manoj Belavadi, Kathie Cameron, Ni Luh Dewi Sintiari

The reconfiguration graph of the $k$ -colorings of a graph $G$ , denoted $R_{k} (G)$ , is the graph whose vertices are the $k$ -colorings of $G$ and two colorings are adjacent in $R_{k}…

math.CO2023★ 2 cited

Recoloring some hereditary graph classes

Manoj Belavadi, Kathie Cameron

The reconfiguration graph of the $k$ -colorings, denoted $R_{k} (G)$ , is the graph whose vertices are the $k$ -colorings of $G$ and two colorings are adjacent in $R_{k} (G)$ if they differ…

math.CO2022★ 6 cited

Reconfiguration of vertex colouring and forbidden induced subgraphs

Manoj Belavadi, Kathie Cameron, Owen Merkel

The reconfiguration graph of the $k$ -colourings, denoted $R_{k} (G)$ , is the graph whose vertices are the $k$ -colourings of $G$ and two colourings are adjacent in $\mathcal{…

math.CO2019★ 1 cited

Structural domination and coloring of some ( $P_{7}, C_{7}$ )-free graphs

S. A. Choudum, T. Karthick, Manoj M. Belavadi

We show that every connected induced subgraph of a graph $G$ is dominated by an induced connected split graph if and only if $G$ is $C$ -free, where $C$ is a set of six…