Pages that link to "Item:Q1845888"

The following pages link to A lower bound for the independence number of a planar graph (Q1845888):

Displaying 10 items.

• Planar graphs have independence ratio at least 3/13 (Q311579) (← links)
• An introduction to the discharging method via graph coloring (Q507506) (← links)
• Induced 2-degenerate subgraphs of triangle-free planar graphs (Q1753031) (← links)
• Planar graphs are \(9/2\)-colorable (Q1791701) (← links)
• Planar graphs without cycles of length 4 or 5 are \((11 : 3)\)-colorable (Q2323251) (← links)
• The maximum size of an independent set in a nonplanar graph (Q4068742) (← links)
• The Independence Ratio and Genus of a Graph (Q4124854) (← links)
• Subcubic triangle-free graphs have fractional chromatic number at most 14/5 (Q5494396) (← links)
• 3‐Degenerate induced subgraph of a planar graph (Q6056810) (← links)
• Independence number and spectral radius of cactus graphs (Q6495260) (← links)