DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Albertson conjecture
Albertson conjecture
Instituto De Computação ✄✂ ✁✂✄✁✂✄✁✂ ✄✁ ✄✂✁ ✄✂ ✁✄✂ ✁ ✂✁✂✁✂✁✂✁✂✁✂✁✂✁ Universidade Estadual De Campinas
Crossings, Colorings, and Cliques
Mathematisches Forschungsinstitut Oberwolfach Graph Theory
Graph Theory Graph Theory (II)
Graph Coloring: a Novel Heuristic Based on Trailing Path—Properties, Perspective and Applications in Structured Networks
Towards the Albertson Conjecture
Hyperbolic Families and Coloring Graphs on Surfaces
Colorings, Cliques and Relaxations of Planarity
Bounded Crossing Number By
Graph Coloring: a Novel Heuristic Based on Trailing Path; Properties, Perspective and Applications in Structured Networks
Graph Coloring: a Novel Heuristic Based On
TOWARDS the ALBERTSON CONJECTURE Dedicated to The
Graph Algorithms
Towards the Albertson Conjecture
Arxiv:1609.06749V2 [Math.CO] 6 May 2018 G Wrspormadtecnd Eerhcar Program
[Math.CO] 18 Jun 2010 Crossings, Colorings, and Cliques
Graph Theory & Probability Graph Theory
On Topological Graphs with at Most Four Crossings Per Edge
Top View
OTKA-75837 Kutatási Zárójelentés
Arxiv:1511.00270V1 [Math.CO] 1 Nov 2015 5.3 Carsten Thomassen