The following pages link to T. Karthick (Q298978):
Displaying 36 items.
- Weighted independent sets in classes of \(P_6\)-free graphs (Q298979) (← links)
- Star chromatic bounds (Q327688) (← links)
- Structure of squares and efficient domination in graph classes (Q338382) (← links)
- Maximum weight independent sets in classes related to claw-free graphs (Q344862) (← links)
- On atomic structure of \(P_5\)-free subclasses and maximum weight independent set problem (Q385962) (← links)
- Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs (Q536214) (← links)
- A characterization of claw-free \(b\)-perfect graphs (Q658056) (← links)
- Polynomial cases for the vertex coloring problem (Q666663) (← links)
- Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs (Q712269) (← links)
- Maximum weight independent sets in hole- and dart-free graphs (Q714022) (← links)
- Square-free graphs with no induced fork (Q831350) (← links)
- Weighted independent sets in a subclass of \(P_6\)-free graphs (Q906493) (← links)
- Weighted efficient domination in two subclasses of \(P_6\)-free graphs (Q908292) (← links)
- First-fit coloring of \(\{P_{5},K_{4}-e\}\)-free graphs (Q968185) (← links)
- Linear chromatic bounds for a subfamily of \(3K_{1}\)-free graphs (Q1014826) (← links)
- Star coloring of certain graph classes (Q1706426) (← links)
- Chromatic bounds for some classes of \(2 K_2\)-free graphs (Q1783621) (← links)
- Efficient domination for classes of \(P_6\)-free graphs (Q2030432) (← links)
- Coloring of \((P_5, 4\)-wheel)-free graphs (Q2113346) (← links)
- Coloring graph classes with no induced fork via perfect divisibility (Q2161205) (← links)
- Structural domination and coloring of some \(( P_7 , C_7)\)-free graphs (Q2222949) (← links)
- Independent sets in some classes of \(S_{i,j,k}\)-free graphs (Q2410110) (← links)
- On the chromatic number of (\(P_6\), diamond)-free graphs (Q2413634) (← links)
- Vizing bound for the chromatic number on some graph classes (Q2631086) (← links)
- Independent Sets in Classes Related to Chair-Free Graphs (Q2795949) (← links)
- Maximum Weight Independent Sets in ( $$S_{1,1,3}$$ , bull)-free Graphs (Q2817880) (← links)
- Star coloring of subcubic graphs (Q2860866) (← links)
- (Q2876042) (← links)
- Perfect coloring and linearly χ-boundP6-free graphs (Q3437005) (← links)
- Coloring (gem, co‐gem)‐free graphs (Q4646937) (← links)
- (Q5143391) (← links)
- New Polynomial Case for Efficient Domination in P 6-free Graphs (Q5174951) (← links)
- Square-Free Graphs with No Six-Vertex Induced Path (Q5232134) (← links)
- On graphs with no induced five‐vertex path or paraglider (Q6055942) (← links)
- Coloring graphs with no induced five‐vertex path or gem (Q6134643) (← links)
- Coloring (\(P_5\), kite)-free graphs with small cliques (Q6180573) (← links)
