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

Showing 2026Show all

2 papers · 1 filter

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…