Pages that link to "Item:Q1584424"

The following pages link to Colour-critical graphs with few edges (Q1584424):

Displaying 32 items.

• Color-critical graphs have logarithmic circumference (Q550393) (← links)
• On the edge-density of 4-critical graphs (Q624211) (← links)
• Characterizing 4-critical graphs with Ore-degree at most seven (Q684124) (← links)
• Note on robust critical graphs with large odd girth (Q960960) (← links)
• On color critical graphs (Q1059085) (← links)
• Note to a problem of T. Gallai and G. A. Dirac (Q1076035) (← links)
• Gallai's problem on Dirac's construction (Q1197042) (← links)
• On a conjecture of Gallai concerning complete subgraphs of \(k\)-critical graphs (Q1198644) (← links)
• On the minimal number of edges in color-critical graphs (Q1272188) (← links)
• Size, chromatic number, and connectivity (Q1340118) (← links)
• A critically chromatic graph (Q1366769) (← links)
• A new lower bound on the number of edges in colour-critical graphs and hypergraphs (Q1405127) (← links)
• Edge lower bounds for list critical graphs, via discharging (Q1715067) (← links)
• Edge-coloring critical graphs with high degree (Q1850002) (← links)
• Dense critical and vertex-critical graphs (Q1850041) (← links)
• A note on a conjecture of Dirac (Q1850068) (← links)
• Minimal orientations of colour critical graphs (Q1894707) (← links)
• On complete subgraphs of color-critical graphs (Q1897440) (← links)
• Some remarks on \((k-1)\)-critical subgraphs of \(k\)-critical graphs (Q1906843) (← links)
• Counting substructures. I: Color critical graphs (Q1959675) (← links)
• Independent sets in \(n\)-vertex \(k\)-chromatic \(\ell \)-connected graphs (Q2032704) (← links)
• Counting critical subgraphs in \(k\)-critical graphs (Q2064752) (← links)
• The minimum number of edges in a 4-critical graph that is bipartite plus 3 edges (Q2255804) (← links)
• Hajós theorem for colorings of edge-weighted graphs (Q2567409) (← links)
• Structure in sparse \(k\)-critical graphs (Q2673484) (← links)
• A list version of Dirac's theorem on the number of edges in colour-critical graphs (Q3651176) (← links)
• (Q3807244) (← links)
• Critically cochromatic graphs (Q3832592) (← links)
• Graphs with least number of colorings (Q4842706) (← links)
• A Problem in Graph Theory (Q5331782) (← links)
• Order plus size of τ‐critical graphs (Q6055381) (← links)
• Generalized DP-colorings of graphs (Q6091813) (← links)