Pages that link to "Item:Q5491719"

The following pages link to Combinatorial Geometry and Graph Theory (Q5491719):

Displaying 10 items.

• An \(O(n\log n)\) algorithm for finding edge span of cacti (Q281767) (← links)
• The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones (Q477637) (← links)
• The backbone coloring problem for bipartite backbones (Q497343) (← links)
• On the advice complexity of the online \(L(2,1)\)-coloring problem on paths and cycles (Q744081) (← links)
• On the hardness of computing span of subcubic graphs (Q888955) (← links)
• The distant-2 chromatic number of random proximity and random geometric graphs (Q963353) (← links)
• \(\lambda \)-backbone colorings along pairwise disjoint stars and matchings (Q1045046) (← links)
• Optimal backbone coloring of split graphs with matching backbones (Q2259577) (← links)
• The computational complexity of the backbone coloring problem for planar graphs with connected backbones (Q2341776) (← links)
• Online \(L(2,1)\)-coloring problem on paths with restricted size of memory (Q6043925) (← links)