Pages that link to "Item:Q507506"

The following pages link to An introduction to the discharging method via graph coloring (Q507506):

Displaying 34 items.

• Homomorphisms of sparse signed graphs (Q782945) (← links)
• On the strong chromatic index of sparse graphs (Q1658764) (← links)
• Light paths and edges in families of outer-1-planar graphs (Q1751428) (← links)
• Injective choosability of subcubic planar graphs with girth 6 (Q2012551) (← links)
• On acyclic 4-choosability of planar graphs without cycles of length 4, 7 and 9 (Q2032901) (← links)
• On weak flexibility in planar graphs (Q2093108) (← links)
• Remarks on proper conflict-free colorings of graphs (Q2099465) (← links)
• On the largest planar graphs with everywhere positive combinatorial curvature (Q2101172) (← links)
• 3-vertices with fewest 2-neighbors in plane graphs with no long paths of 2-vertices (Q2142641) (← links)
• The chromatic number of signed graphs with bounded maximum average degree (Q2143044) (← links)
• On the structure of essentially-highly-connected polyhedral graphs (Q2172412) (← links)
• Additive list coloring of planar graphs with given girth (Q2175242) (← links)
• All tight descriptions of 3-paths in plane graphs with girth 8 (Q2182227) (← links)
• Flexibility of planar graphs -- sharpening the tools to get lists of size four (Q2243143) (← links)
• Odd graph and its applications to the strong edge coloring (Q2279245) (← links)
• Planar graphs with girth 20 are additively 3-choosable (Q2306581) (← links)
• All tight descriptions of 3-paths centered at 2-vertices in plane graphs with girth at least 6 (Q2334769) (← links)
• \((4,2)\)-choosability of planar graphs with forbidden structures (Q2409516) (← links)
• On star 5-colorings of sparse graphs (Q2656970) (← links)
• Degeneracy and colorings of squares of planar graphs without 4-cycles (Q2658379) (← links)
• All tight descriptions of 3-paths in plane graphs with girth at least 7 (Q2659247) (← links)
• Cyclic coloring of plane graphs with maximum face size 16 and 17 (Q2662786) (← links)
• Independent bondage number of planar graphs with minimum degree at least 3 (Q2675833) (← links)
• The \((3, 3)\)-colorability of planar graphs without 4-cycles and 5-cycles (Q2685340) (← links)
• Light structures in infinite planar graphs without the strong isoperimetric property (Q4529727) (← links)
• The number of small-degree vertices in matchstick graphs (Q5060444) (← links)
• Plane Graphs without 4- and 5-Cycles and without Ext-Triangular 7-Cycles are 3-Colorable (Q5351865) (← links)
• Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$‐choosable (Q6047966) (← links)
• Saturation for the 3-uniform loose 3-cycle (Q6091820) (← links)
• Automated testing and interactive construction of unavoidable sets for graph classes of small path‐width (Q6094029) (← links)
• A tight bound for independent domination of cubic graphs without 4‐cycles (Q6094034) (← links)
• Tight description of faces of triangulations on the torus (Q6098092) (← links)
• Square Coloring Planar Graphs with Automatic Discharging (Q6141869) (← links)
• Light 3-paths in 3-polytopes without adjacent triangles (Q6203328) (← links)