Name
Affiliation
Papers
MARIA CHUDNOVSKY
Princeton University, Princeton, NJ 08544
68
Collaborators
Citations 
PageRank 
61
390
46.13
Referers 
Referees 
References 
526
261
201
Search Limit
100526
Title
Citations
PageRank
Year
FINDING LARGE H-COLORABLE SUBGRAPHS IN HEREDITARY GRAPH CLASSES00.342021
Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings00.342021
A Note On Simplicial Cliques00.342021
List 3-Coloring Graphs With No Induced P-6 + Rp(3)00.342021
Erdős-Hajnal for cap-free graphs00.342021
Better 3-Coloring Algorithms: Excluding A Triangle And A Seven Vertex Path00.342021
On the Maximum Weight Independent Set Problem in Graphs without Induced Cycles of Length at Least Five.00.342020
Corrigendum to "Bisimplicial vertices in even-hole-free graphs".00.342020
Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes20.852020
Pure pairs. III. Sparse graphs with no polynomial-sized anticomplete pairs.00.342020
Finding Large H-Colorable Subgraphs in Hereditary Graph Classes.00.342020
Cooperative colorings of trees and of bipartite graphs00.342020
Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs.00.342020
List 3-coloring Pt-free graphs with no induced 1-subdivision of K1,s00.342020
Complexity of Ck-Coloring in Hereditary Classes of Graphs.00.342019
Triangle‐free graphs that do not contain an induced subdivision of K 4 are 3‐colorable00.342019
Induced subgraphs of graphs with large chromatic number. XII. Distant stars: CHUDNOVSKY et al.00.342019
Perfect divisibility and 2-divisibility.00.342019
Disjoint paths in unions of tournaments.00.342019
Induced subgraphs of graphs with large chromatic number. XI. Orientations.00.342019
Induced subgraphs of graphs with large chromatic number. XII. Distant stars00.342019
Triangle-free graphs with no six-vertex induced path.00.342018
Four-coloring P6-free graphs. II. Finding an excellent precoloring.00.342018
Corrigendum to "Even pairs and prism corners in square-free Berge graphs" [J. Combin. Theory, Ser. B 131 (2018) 12-39].00.342018
A short proof of the wonderful lemma.00.342018
Four-coloring Ps6-free graphs. I. Extending an excellent precoloring.00.342018
Domination in tournaments.00.342018
The Sandwich Problem for Decompositions and Almost Monotone Properties.00.342018
Even pairs and prism corners in square-free Berge graphs.00.342018
Odd Holes in Bull-Free Graphs00.342018
Vertex-minors and the Erdős-Hajnal conjecture.00.342018
Induced Subgraphs of Graphs with Large Chromatic Number. III. Long Holes.60.992017
4-Coloring P6-Free Graphs with No Induced 5-Cycles.00.342017
Colouring perfect graphs with bounded clique number.00.342017
OBSTRUCTIONS FOR THREE-COLORING AND LIST THREE-COLORING H-FREE GRAPHS10.362017
Approximately coloring graphs without long induced paths.00.342017
Obstructions for three-coloring graphs with one forbidden induced subgraph.30.432016
Unavoidable induced subgraphs in large graphs with no homogeneous sets20.512016
Disjoint dijoins.00.342016
Excluding paths and antipaths.30.502015
Cliques in the union of graphs10.432015
Excluding a Substar and an Antisubstar.00.342015
Excluding pairs of graphs.30.612014
A counterexample to a conjecture of Schwartz.50.722013
Immersion in four-edge-connected graphs.40.462013
A Local Strengthening of Reed's Omega, Delta, Chi Conjecture for Quasi-line Graphs.50.572013
Large cliques or stable sets in graphs with no four-edge path and no five-edge path in the complement70.732012
Analyzing the performance of greedy maximal scheduling via local pooling and graph theory161.062012
Packing seagulls.00.342012
Growing Without Cloning.00.342012
  • 1
  • 2