The following pages link to (Q5749319):
Displaying 50 items.
- Restricted frame graphs and a conjecture of Scott (Q252837) (← links)
- Induced subgraphs of graphs with large chromatic number. II. Three steps towards Gyárfás' conjectures (Q256991) (← links)
- Intersection graphs of L-shapes and segments in the plane (Q277615) (← links)
- Chromatic number of \(P_5\)-free graphs: Reed's conjecture (Q279215) (← links)
- A dichotomy theorem for circular colouring reconfiguration (Q301588) (← links)
- Proper orientation of cacti (Q301589) (← links)
- Fractional Turan's theorem and bounds for the chromatic number (Q324870) (← links)
- Induced subgraphs of graphs with large chromatic number. I. Odd holes (Q326809) (← links)
- Star chromatic bounds (Q327688) (← links)
- Triangle-free geometric intersection graphs with large chromatic number (Q377499) (← links)
- Colouring of graphs with Ramsey-type forbidden subgraphs (Q393895) (← links)
- Triangle-free intersection graphs of line segments with large chromatic number (Q401487) (← links)
- Extending the Gyárfás-Sumner conjecture (Q401488) (← links)
- Matchings, coverings, and Castelnuovo-Mumford regularity (Q405389) (← links)
- Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane (Q412277) (← links)
- Independent sets and matchings in subcubic graphs (Q427833) (← links)
- On graphs with no induced subdivision of \(K_4\) (Q444381) (← links)
- Substitution and \(\chi\)-boundedness (Q461725) (← links)
- Excluding cycles with a fixed number of chords (Q476296) (← links)
- Two complexity results for the vertex coloring problem (Q505438) (← links)
- Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors (Q505914) (← links)
- On the chromatic number of \((P_{5},K_{2,t})\)-free graphs (Q510963) (← links)
- Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree (Q512863) (← links)
- A polynomial Turing-kernel for weighted independent set in bull-free graphs (Q521799) (← links)
- Total chromatic number of unichord-free graphs (Q643026) (← links)
- The chromatic gap and its extremes (Q713979) (← links)
- Induced subgraphs of graphs with large chromatic number. III: Long holes (Q722311) (← links)
- Induced subgraphs of graphs with large chromatic number. IV: Consecutive holes (Q723885) (← links)
- Coloring non-crossing strings (Q727171) (← links)
- List-coloring claw-free graphs with small clique number (Q742576) (← links)
- On the chromatic number of disjointness graphs of curves (Q777485) (← links)
- Square-free graphs with no induced fork (Q831350) (← links)
- Chromatic bounds for the subclasses of \(pK_2\)-free graphs (Q831732) (← links)
- On the structure of certain intersection graphs (Q845675) (← links)
- Tree-chromatic number (Q896001) (← links)
- The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree (Q912124) (← links)
- \(K_{4}\)-free graphs with no odd holes (Q965257) (← links)
- Stable sets in \(k\)-colorable \(P_{5}\)-free graphs (Q990082) (← links)
- Constructions for normal graphs and some consequences (Q1003480) (← links)
- Large induced trees in \(K_r\)-free graphs (Q1003853) (← links)
- Linear chromatic bounds for a subfamily of \(3K_{1}\)-free graphs (Q1014826) (← links)
- Triangle-free strongly circular-perfect graphs (Q1025560) (← links)
- Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences (Q1026014) (← links)
- The strong perfect graph conjecture: 40 years of attempts, and its resolution (Q1045106) (← links)
- Colorful induced subgraphs (Q1197025) (← links)
- Induced cycles and chromatic number (Q1306304) (← links)
- Covering and coloring polygon-circle graphs (Q1356563) (← links)
- Maximum induced matchings in graphs (Q1363677) (← links)
- Classes of graphs that exclude a tree and a clique and are not vertex Ramsey (Q1375696) (← links)
- Coloring the hypergraph of maximal cliques of a graph with no long path (Q1412673) (← links)
