Pages that link to "Item:Q1903716"
From MaRDI portal
The following pages link to On graphs without \(P_ 5\) and \(\overline {P}_ 5\) (Q1903716):
Displayed 42 items.
- Chromatic number of \(P_5\)-free graphs: Reed's conjecture (Q279215) (← links)
- Star chromatic bounds (Q327688) (← links)
- On color-critical (\(P_5\),\(\operatorname{co-}P_5\))-free graphs (Q344847) (← links)
- On the chromatic number of \((P_{5},K_{2,t})\)-free graphs (Q510963) (← links)
- Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs (Q536214) (← links)
- Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs (Q712269) (← links)
- Chromatic bounds for the subclasses of \(pK_2\)-free graphs (Q831732) (← links)
- Maximum independent sets in subclasses of \(P_{5}\)-free graphs (Q976106) (← links)
- The stable set polytope for some extensions of \(P_4\)-free graphs (Q998505) (← links)
- Linear chromatic bounds for a subfamily of \(3K_{1}\)-free graphs (Q1014826) (← links)
- On minimal imperfect graphs without induced \(P_5\) (Q1293187) (← links)
- Stable sets in certain \(P_6\)-free graphs (Q1304476) (← links)
- On semi-\(P_ 4\)-sparse graphs (Q1356751) (← links)
- Weighted parameters in \((P_5,\overline {P_5})\)-free graphs (Q1382285) (← links)
- Stability number of bull- and chair-free graphs revisited (Q1408811) (← links)
- On the structure and stability number of \(P_{5}\)- and co-chair-free graphs (Q1414581) (← links)
- Some results on maximum stable sets in certain \(P_{5}\)-free graphs (Q1414592) (← links)
- Stability in \(P_5\)- and banner-free graphs (Q1580977) (← links)
- On the chromatic number of \(2 K_2\)-free graphs (Q1634757) (← links)
- Star coloring of certain graph classes (Q1706426) (← links)
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey (Q1733849) (← links)
- Independent sets in extensions of 2\(K_{2}\)-free graphs (Q1765375) (← links)
- Chromatic bounds for some classes of \(2 K_2\)-free graphs (Q1783621) (← links)
- On the stable set problem in special \(P_{5}\)-free graphs (Q1861559) (← links)
- Coloring of \((P_5, 4\)-wheel)-free graphs (Q2113346) (← links)
- On the chromatic number of some \(P_5\)-free graphs (Q2144602) (← links)
- Structural domination and coloring of some \(( P_7 , C_7)\)-free graphs (Q2222949) (← links)
- Polynomial-time algorithms for minimum weighted colorings of \((P_5, \overline{P}_5)\)-free graphs and similar graph classes (Q2345603) (← links)
- Some observations on maximum weight stable sets in certain \(P_{5}\)-free graphs (Q2384837) (← links)
- On-line graph coloring of \({\mathbb{P}_5}\)-free graphs (Q2482722) (← links)
- Vizing bound for the chromatic number on some graph classes (Q2631086) (← links)
- A tight linear bound to the chromatic number of \((P_5, K_1 +(K_1 \cup K_3))\)-free graphs (Q2701401) (← links)
- Local transformations of graphs preserving independence number (Q4242792) (← links)
- On the chromatic number of (P_{5},windmill)-free graphs (Q4690990) (← links)
- GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH (Q5696971) (← links)
- On indicated coloring of some classes of graphs (Q5919702) (← links)
- On graphs with no induced five‐vertex path or paraglider (Q6055942) (← links)
- On the chromatic number of \(P_5\)-free graphs with no large intersecting cliques (Q6084676) (← links)
- Coloring graphs without induced \(P_5\) or \(K_5-e\) (Q6089566) (← links)
- Improved bounds on the chromatic number of (\(P_5\), flag)-free graphs (Q6098088) (← links)
- Bounds for the chromatic number of some \(pK_2\)-free graphs (Q6103479) (← links)
- Coloring graphs with no induced five‐vertex path or gem (Q6134643) (← links)