Pages that link to "Item:Q2131867"

The following pages link to Colouring graphs with sparse neighbourhoods: bounds and applications (Q2131867):

Displaying 30 items.

• A superlocal version of Reed's conjecture (Q490262) (← links)
• Coloring graphs with sparse neighborhoods (Q1569053) (← links)
• Strong chromatic index of graphs with maximum degree four (Q1671652) (← links)
• Sparse \(H\)-colourable graphs of bounded maximum degree (Q1889843) (← links)
• Corrigendum to: ``A local epsilon version of Reed's conjecture'' (Q1984533) (← links)
• Strong edge-colorings of sparse graphs with \(3\Delta-1\) colors (Q2094384) (← links)
• Bounding \(\chi\) by a fraction of \(\Delta\) for graphs without large cliques (Q2171021) (← links)
• List strong edge-coloring of graphs with maximum degree 4 (Q2174601) (← links)
• Graph coloring in the estimation of sparse derivative matrices: Instances and applications (Q2467363) (← links)
• Hypergraph incidence coloring (Q2689485) (← links)
• A procedure for the strategic planning of locations, capacities and districting of jails: application to Chile (Q4680754) (← links)
• A Complexity Dichotomy for the Coloring of Sparse Graphs (Q4920652) (← links)
• 子立方平面图的$(1,0)$-松弛强边列表染色 (Q5037961) (← links)
• Between Proper and Strong Edge-Colorings of Subcubic Graphs (Q5041205) (← links)
• Recent progress on strong edge-coloring of graphs (Q5242836) (← links)
• Colouring graphs with forbidden bipartite subgraphs (Q5885184) (← links)
• A local epsilon version of Reed's conjecture (Q5919302) (← links)
• A GRASP for coloring sparse graphs (Q5938473) (← links)
• Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth (Q6080127) (← links)
• Strong list-chromatic index of planar graphs with Ore-degree at most seven (Q6083189) (← links)
• A proof of the Erdős-Faber-Lovász conjecture (Q6093285) (← links)
• Strong edge-coloring of 2-degenerate graphs (Q6103470) (← links)
• The tight bound for the strong chromatic indices of claw-free subcubic graphs (Q6115426) (← links)
• A note on strong edge-coloring of claw-free cubic graphs (Q6138357) (← links)
• (Q6162646) (← links)
• Proper edge-colorings with a rich neighbor requirement (Q6177411) (← links)
• Revisiting semistrong edge‐coloring of graphs (Q6199384) (← links)
• Strong Edge Coloring of Outerplane Graphs with Independent Crossings (Q6489818) (← links)
• Strong edge coloring of subquartic graphs (Q6606224) (← links)
• Solution to a problem of Erdős on the chromatic index of hypergraphs with bounded codegree (Q6659522) (← links)