FINDING LARGE H-COLORABLE SUBGRAPHS IN HEREDITARY GRAPH CLASSES | 0 | 0.34 | 2021 |
Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings | 0 | 0.34 | 2021 |
A Note On Simplicial Cliques | 0 | 0.34 | 2021 |
List 3-Coloring Graphs With No Induced P-6 + Rp(3) | 0 | 0.34 | 2021 |
Erdős-Hajnal for cap-free graphs | 0 | 0.34 | 2021 |
Better 3-Coloring Algorithms: Excluding A Triangle And A Seven Vertex Path | 0 | 0.34 | 2021 |
On the Maximum Weight Independent Set Problem in Graphs without Induced Cycles of Length at Least Five. | 0 | 0.34 | 2020 |
Corrigendum to "Bisimplicial vertices in even-hole-free graphs". | 0 | 0.34 | 2020 |
Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes | 2 | 0.85 | 2020 |
Pure pairs. III. Sparse graphs with no polynomial-sized anticomplete pairs. | 0 | 0.34 | 2020 |
Finding Large H-Colorable Subgraphs in Hereditary Graph Classes. | 0 | 0.34 | 2020 |
Cooperative colorings of trees and of bipartite graphs | 0 | 0.34 | 2020 |
Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs. | 0 | 0.34 | 2020 |
List 3-coloring Pt-free graphs with no induced 1-subdivision of K1,s | 0 | 0.34 | 2020 |
Complexity of Ck-Coloring in Hereditary Classes of Graphs. | 0 | 0.34 | 2019 |
Triangle‐free graphs that do not contain an induced subdivision of K 4 are 3‐colorable | 0 | 0.34 | 2019 |
Induced subgraphs of graphs with large chromatic number. XII. Distant stars: CHUDNOVSKY et al. | 0 | 0.34 | 2019 |
Perfect divisibility and 2-divisibility. | 0 | 0.34 | 2019 |
Disjoint paths in unions of tournaments. | 0 | 0.34 | 2019 |
Induced subgraphs of graphs with large chromatic number. XI. Orientations. | 0 | 0.34 | 2019 |
Induced subgraphs of graphs with large chromatic number. XII. Distant stars | 0 | 0.34 | 2019 |
Triangle-free graphs with no six-vertex induced path. | 0 | 0.34 | 2018 |
Four-coloring P6-free graphs. II. Finding an excellent precoloring. | 0 | 0.34 | 2018 |
Corrigendum to "Even pairs and prism corners in square-free Berge graphs" [J. Combin. Theory, Ser. B 131 (2018) 12-39]. | 0 | 0.34 | 2018 |
A short proof of the wonderful lemma. | 0 | 0.34 | 2018 |
Four-coloring Ps6-free graphs. I. Extending an excellent precoloring. | 0 | 0.34 | 2018 |
Domination in tournaments. | 0 | 0.34 | 2018 |
The Sandwich Problem for Decompositions and Almost Monotone Properties. | 0 | 0.34 | 2018 |
Even pairs and prism corners in square-free Berge graphs. | 0 | 0.34 | 2018 |
Odd Holes in Bull-Free Graphs | 0 | 0.34 | 2018 |
Vertex-minors and the Erdős-Hajnal conjecture. | 0 | 0.34 | 2018 |
Induced Subgraphs of Graphs with Large Chromatic Number. III. Long Holes. | 6 | 0.99 | 2017 |
4-Coloring P6-Free Graphs with No Induced 5-Cycles. | 0 | 0.34 | 2017 |
Colouring perfect graphs with bounded clique number. | 0 | 0.34 | 2017 |
OBSTRUCTIONS FOR THREE-COLORING AND LIST THREE-COLORING H-FREE GRAPHS | 1 | 0.36 | 2017 |
Approximately coloring graphs without long induced paths. | 0 | 0.34 | 2017 |
Obstructions for three-coloring graphs with one forbidden induced subgraph. | 3 | 0.43 | 2016 |
Unavoidable induced subgraphs in large graphs with no homogeneous sets | 2 | 0.51 | 2016 |
Disjoint dijoins. | 0 | 0.34 | 2016 |
Excluding paths and antipaths. | 3 | 0.50 | 2015 |
Cliques in the union of graphs | 1 | 0.43 | 2015 |
Excluding a Substar and an Antisubstar. | 0 | 0.34 | 2015 |
Excluding pairs of graphs. | 3 | 0.61 | 2014 |
A counterexample to a conjecture of Schwartz. | 5 | 0.72 | 2013 |
Immersion in four-edge-connected graphs. | 4 | 0.46 | 2013 |
A Local Strengthening of Reed's Omega, Delta, Chi Conjecture for Quasi-line Graphs. | 5 | 0.57 | 2013 |
Large cliques or stable sets in graphs with no four-edge path and no five-edge path in the complement | 7 | 0.73 | 2012 |
Analyzing the performance of greedy maximal scheduling via local pooling and graph theory | 16 | 1.06 | 2012 |
Packing seagulls. | 0 | 0.34 | 2012 |
Growing Without Cloning. | 0 | 0.34 | 2012 |