Pages that link to "Item:Q3057115"

The following pages link to Improper coloring of unit disk graphs (Q3057115):

Displaying 20 items.

• Note on coloring of double disk graphs (Q475816) (← links)
• Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems (Q507444) (← links)
• Dynamic \(F\)-free coloring of graphs (Q1637099) (← links)
• On \(t\)-relaxed 2-distant circular coloring of graphs (Q2045235) (← links)
• An improved approximation for maximum \(k\)-dependent set on bipartite graphs (Q2057593) (← links)
• Polynomial time recognition of vertices contained in all (or no) maximum dissociation sets of a tree (Q2129757) (← links)
• Combining lithography and directed self assembly for the manufacturing of vias: connections to graph coloring problems, integer programming formulations, and numerical experiments (Q2273901) (← links)
• The complexity of dissociation set problems in graphs (Q2275943) (← links)
• Channel assignment problem and relaxed 2-distant coloring of graphs (Q2306601) (← links)
• IMPROPER COLORING OF WEIGHTED GRID AND HEXAGONAL GRAPHS (Q3063610) (← links)
• (Q3304104) (← links)
• Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in Graphs (Q3452575) (← links)
• On t-relaxed chromatic number of r-power paths (Q4634519) (← links)
• (Q5092394) (← links)
• Parameterized (Approximate) Defective Coloring (Q5107096) (← links)
• Defective Coloring on Classes of Perfect Graphs (Q5864723) (← links)
• Maximum weight <i>t</i>-sparse set problem on vector-weighted graphs (Q6140983) (← links)
• Maximum dissociation sets in subcubic trees (Q6176408) (← links)
• Graph partitions under average degree constraint (Q6187347) (← links)
• Minimum number of maximal dissociation sets in trees (Q6193972) (← links)