Vaidy Sivaraman

activity

20112026

most citedClasses of graphs with no long cycle as a vertex-minor are polynomially

χ

-bounded

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

collaborators

Showing 2018Show all

2 papers · 1 filter

math.CO2018★ 9 cited

Classes of graphs with no long cycle as a vertex-minor are polynomially $χ$ -bounded

Ringi Kim, O-joung Kwon, Sang-il Oum +1

A class $G$ of graphs is $χ$ -bounded if there is a function $f$ such that for every graph $G \in G$ and every induced subgraph $H$ of $G$ , $χ (H) \leq f (ω (H))$ . In ad…

math.CO2018

The class of $(P_{7}, C_{4}, C_{5})$ -free graphs: decomposition, algorithms, and $χ$ -boundedness

Kathie Cameron, Shenwei Huang, Irena Penev +1

As usual, $P_{n}$ ( $n \geq 1$ ) denotes the path on $n$ vertices, and $C_{n}$ ( $n \geq 3$ ) denotes the cycle on $n$ vertices. For a family $H$ of graphs, we say that a graph $…

Classes of graphs with no long cycle as a vertex-minor are polynomially χ-bounded

The class of (P7​,C4​,C5​)-free graphs: decomposition, algorithms, and χ-boundedness

Classes of graphs with no long cycle as a vertex-minor are polynomially $χ$ -bounded

The class of $(P_{7}, C_{4}, C_{5})$ -free graphs: decomposition, algorithms, and $χ$ -boundedness