The following pages link to (Q4340879):
Displaying 32 items.
- Binary pattern tile set synthesis is NP-hard (Q527409) (← links)
- Optimizing phylogenetic diversity with ecological constraints (Q659637) (← links)
- The thickness and chromatic number of \(r\)-inflated graphs (Q709322) (← links)
- A self-stabilizing algorithm for the maximum planarization problem in complete bipartite networks (Q987811) (← links)
- Optimizing phylogenetic diversity across two trees (Q1021786) (← links)
- Thickness-two graphs. II: More new nine-critical graphs, independence ratio, cloned planar graphs, and singly and doubly outerplanar graphs (Q1043806) (← links)
- deBruijn-like sequences and the irregular chromatic number of paths and cycles (Q1045102) (← links)
- Antisymmetric flows and strong colourings of oriented graphs (Q1296157) (← links)
- A new proof of Grünbaum's 3 color theorem (Q1357735) (← links)
- A note on not-4-list colorable planar graphs (Q1640221) (← links)
- Network pollution games (Q1755784) (← links)
- Coloring face-hypergraphs of graphs on surfaces (Q1850616) (← links)
- On local transformation of polygons with visibility properties. (Q1853571) (← links)
- A categorical setting for the 4-colour theorem (Q1901000) (← links)
- On the dichromatic number of surfaces (Q2121762) (← links)
- Colorings with neighborhood parity condition (Q2172422) (← links)
- Remarks on odd colorings of graphs (Q2172423) (← links)
- New restrictions on defective coloring with applications to Steinberg-type graphs (Q2185826) (← links)
- Book review of: U. Montano, Explaining beauty in mathematics: an aesthetic theory of mathematics (Q2363616) (← links)
- Even-cycle decompositions of graphs with no odd-\(K_4\)-minor (Q2400967) (← links)
- A note on odd colorings of 1-planar graphs (Q2689651) (← links)
- Coloring of plane graphs with unique maximal colors on faces (Q2833253) (← links)
- Reoptimization under vertex insertion: max \(P_{k}\)-free subgraph and max planar subgraph (Q2846477) (← links)
- The Four Colour Theorem: Engineering of a Formal Proof (Q3598006) (← links)
- Proof of Conway’s lost cosmological theorem (Q4373833) (← links)
- (Q4514229) (← links)
- One Probabilistic Equivalent of the Four Color Conjecture (Q4830860) (← links)
- One More Probabilistic Reformulation of the Four Colour Conjecture (Q4911115) (← links)
- The challenge of computer mathematics (Q5301849) (← links)
- Some Conjectures and Questions in Chromatic Topological Graph Theory (Q5506783) (← links)
- The degree/diameter problem in maximal planar bipartite graphs (Q5890615) (← links)
- Kempe classes and almost bipartite graphs (Q6611011) (← links)
