The following pages link to (Q4228512):
Displaying 30 items.
- Coloring planar homothets and three-dimensional hypergraphs (Q364847) (← links)
- Evader interdiction: algorithms, complexity and collateral damage (Q490228) (← links)
- Acyclically 3-colorable planar graphs (Q695319) (← links)
- On problems without polynomial kernels (Q1034099) (← links)
- Maximum face-constrained coloring of plane graphs (Q1421525) (← links)
- Graph separators: A parameterized view (Q1877710) (← links)
- Coloring Eulerian triangulations of the Klein bottle (Q1926035) (← links)
- Ugly mathematics: why do mathematicians dislike computer-assisted proofs? (Q1935355) (← links)
- Fast 3-coloring triangle-free planar graphs (Q1957652) (← links)
- Integer plane multiflow maximisation: one-quarter-approximation and gaps (Q2089777) (← links)
- Time complexity analysis of randomized search heuristics for the dynamic graph coloring problem (Q2240131) (← links)
- Non-monochromatic and conflict-free colorings on tree spaces and planar network spaces (Q2309464) (← links)
- Complexity of the improper twin edge coloring of graphs (Q2409501) (← links)
- Local 7-coloring for planar subgraphs of unit disk graphs (Q2430012) (← links)
- Maximal strip recovery problem with gaps: hardness and approximation algorithms (Q2434927) (← links)
- New linear-time algorithms for edge-coloring planar graphs (Q2479530) (← links)
- A Markov chain on the solution space of edge colorings of bipartite graphs (Q2696608) (← links)
- Solving Matching Problems Efficiently in Bipartite Graphs (Q2946048) (← links)
- Improper coloring of unit disk graphs (Q3057115) (← links)
- Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count (Q4625139) (← links)
- (Q4691855) (← links)
- Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs (Q4961756) (← links)
- Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation (Q5041741) (← links)
- Contracting a Planar Graph Efficiently (Q5111739) (← links)
- Planar 3-SAT with a clause/variable cycle (Q5116495) (← links)
- Solving Constraint-Satisfaction Problems with Distributed Neocortical-Like Neuronal Networks (Q5157180) (← links)
- On Injective Colourings of Chordal Graphs (Q5458556) (← links)
- (Q5708606) (← links)
- Solving combinatorial optimisation problems using oscillator based Ising machines (Q6095496) (← links)
- Disjoint total dominating sets in near‐triangulations (Q6142659) (← links)
