Pages that link to "Item:Q1272188"

The following pages link to On the minimal number of edges in color-critical graphs (Q1272188):

Displaying 20 items.

• A better lower bound on average degree of 4-list-critical graphs (Q311559) (← links)
• Ore's conjecture on color-critical graphs is almost true (Q462926) (← links)
• Critically paintable, choosable or colorable graphs (Q713164) (← links)
• On list critical graphs (Q1044925) (← links)
• The concentration of the chromatic number of random graphs (Q1280244) (← links)
• A new lower bound on the number of edges in colour-critical graphs and hypergraphs (Q1405127) (← links)
• Colour-critical graphs with few edges (Q1584424) (← links)
• A Brooks-type result for sparse critical graphs (Q1786052) (← links)
• On the number of edges in hypergraphs critical with respect to strong colourings (Q1971806) (← links)
• Independent sets in \(n\)-vertex \(k\)-chromatic \(\ell \)-connected graphs (Q2032704) (← links)
• Improved lower bounds on the number of edges in list critical and online list critical graphs (Q2284728) (← links)
• On the minimum number of edges in triangle-free 5-critical graphs (Q2403700) (← links)
• Structure in sparse \(k\)-critical graphs (Q2673484) (← links)
• Almost all graphs with high girth and suitable density have high chromatic number (Q2746204) (← links)
• Lower Bounds for On-line Graph Colorings (Q2942655) (← links)
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
• A list version of Dirac's theorem on the number of edges in colour-critical graphs (Q3651176) (← links)
• Large cliques and independent sets all over the place (Q4992901) (← links)
• Bounds on Ramsey games via alterations (Q6081572) (← links)
• On Density of \(\boldsymbol{\mathbb{Z}_3}\) -Flow-Critical Graphs (Q6098458) (← links)