Pages that link to "Item:Q1250224"
From MaRDI portal
The following pages link to Every planar map is four colorable. II: Reducibility (Q1250224):
Displaying 50 items.
- Looseness and independence number of triangulations on closed surfaces (Q726633) (← links)
- List coloring the square of sparse graphs with large degree (Q740267) (← links)
- Automated generation of conjectures on forbidden subgraph characterization (Q741737) (← links)
- A bound on the chromatic number of an almost planar graph (Q744556) (← links)
- Clique minors in claw-free graphs (Q765191) (← links)
- Connected greedy coloring of \(H\)-free graphs (Q777440) (← links)
- Solving the 3-COL problem by using tissue P systems without environment and proteins on cells (Q781876) (← links)
- A proof via finite elements for Schiffer's conjecture on a regular pentagon (Q827006) (← links)
- Fullerene graphs have exponentially many perfect matchings (Q839387) (← links)
- On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P (Q845727) (← links)
- On the connectivity of minimum and minimal counterexamples to Hadwiger's conjecture (Q858685) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- A relaxed Hadwiger's conjecture for list colorings (Q885300) (← links)
- Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable (Q898156) (← links)
- Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable (Q898165) (← links)
- On a generalization of ``eight blocks to madness'' puzzle (Q906490) (← links)
- Some remarks on the odd Hadwiger's conjecture (Q950324) (← links)
- A uniform family of tissue P systems with cell division solving 3-COL in a linear time (Q953542) (← links)
- A new clustering algorithm for coordinate-free data (Q962672) (← links)
- Facial colorings using Hall's theorem (Q966152) (← links)
- A simple algorithm for 4-coloring 3-colorable planar graphs (Q974757) (← links)
- Nowhere-zero 4-flow in almost Petersen-minor free graphs (Q1011772) (← links)
- Linear connectivity forces large complete bipartite minors (Q1026000) (← links)
- Note on coloring graphs without odd-\(K_k\)-minors (Q1026013) (← links)
- List-coloring graphs without \(K_{4,k}\)-minors (Q1028458) (← links)
- Cliques, minors and apex graphs (Q1043579) (← links)
- Thickness-two graphs. II: More new nine-critical graphs, independence ratio, cloned planar graphs, and singly and doubly outerplanar graphs (Q1043806) (← links)
- Planar graphs without adjacent cycles of length at most seven are 3-colorable (Q1045158) (← links)
- Efficient bounds for the stable set, vertex cover and set packing problems (Q1056763) (← links)
- Heawood's empire problem (Q1062996) (← links)
- The four color proof suffices (Q1066155) (← links)
- Heawood inequalities (Q1092918) (← links)
- Map coloring and the vector cross product (Q1099183) (← links)
- How robust is the n-cube? (Q1104728) (← links)
- Hadwiger's conjecture (ḵ\(=6):\) Neighbour configurations of 6-vertices in contraction-critical graphs (Q1119593) (← links)
- On the Penrose number of cubic diagrams (Q1124600) (← links)
- List homomorphisms to reflexive graphs (Q1127870) (← links)
- The book thickness of a graph (Q1136775) (← links)
- Hadwiger's conjecture for graphs on the Klein bottle (Q1142782) (← links)
- On Tutte's extension of the four-colour problem (Q1157338) (← links)
- On the relationship between the biconnectivity augmentation and traveling salesman problems (Q1165162) (← links)
- Heuristic for rapidly four-coloring large planar graphs (Q1180542) (← links)
- Modernizing the philosophy of mathematics (Q1182173) (← links)
- Colouring problems (Q1255499) (← links)
- Hadwiger's conjecture for \(K_ 6\)-free graphs (Q1311018) (← links)
- Realizing the chromatic numbers of triangulations of surfaces (Q1313860) (← links)
- Lower bounds for constant degree independent sets (Q1322210) (← links)
- A note on the minimum cut cover of graphs (Q1342081) (← links)
- Simultaneously colouring the edges and faces of plane graphs (Q1354728) (← links)
- The four-colour theorem (Q1369648) (← links)
