DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Moser spindle
Moser spindle
The Unit Distance Graph Problem and Equivalence Relations
SAT Approach for Decomposition Methods
Eindhoven University of Technology BACHELOR on the K-Independent
A Proof of Tomescu's Graph Coloring Conjecture
Toward a Unit Distance Embedding for the Heawood Graph
SZAKDOLGOZAT Probabilistic Formulation of the Hadwiger
Constructing 5-Chromatic Unit Distance Graphs Embedded in the Euclidean Plane and Two-Dimensional Spheres
Chromatic Number of Euclidean Plane
(V, E ) Be a Graph and Let F Be a Function That Assigns to Each Vertex of F:V(G) → {1,2,.....K} Such That for V to a Set of Values from the Set {1,2
Fractional Refinements of Integral Theorems
On the Chromatic Numbers of Planes
Introduction to Ramsey Theory
Cycle Related Graphs on Square Difference Labeling
On the Density of Planar Sets Without Unit Distances 11
New 4-Chromatic Planar Graphs∗
Asia Mathematika on Coloring Distance Graphs
15 a SAT Approach to Branchwidth
Coloring Unit-Distance Strips Using SAT
Top View
Lower Bounds for the Measurable Chromatic Number of the Hyperbolic Plane
Lecture 2: Graph Theory 1 the Basics
An Introduction to Ramsey Theory on Graphs
Realizability of Graphs and Linkages
Coloring Circle Arrangements: New 4-Chromatic Planar Graphs∗
Walks, Transitions and Geometric Distances in Graphs
1. Do Not Look at the Test Before the Proctor Starts the Round. 2. This Test
On the Computational Complexity of Degenerate Unit Distance
Who Needs Crossings? Hardness of Plane Graph Rigidity
A SAT Approach to Branchwidth
König's Lemma 1 the Unit Distance Graph Problem
The Chromatic Number of the Plane Is at Least 5-A New Proof
Explorations on the Dimension of a Graph
The Vector Graph and the Chromatic Number of the Plane, Or How NOT to Prove That Χ(E2) > 4
Who Needs Crossings? Hardness of Plane Graph Rigidity
A Survey of Repositories in Graph Theory
THE FRACTIONAL CHROMATIC NUMBER of the PLANE 1. Introduction a Proper Coloring of the Plane Assigns to Each of Its Points a Colo
Dominator Chromatic Number, Bondage Number and Domatic Number of Some Named Graphs
Harmonious Chromatic Number, Bondage Number, Domatic Number of Some Special Graphs
CIRCULAR COLORING the PLANE 1. Introduction. the Unit Distance
Coloring and Constructing (Hyper)Graphs with Restrictions
2003 Vol 16 No 1
Strong Equitable and Inverse Strong Equitable Domination Number of Some Special Classes of Graphs
Proceedings of the 17Th Cologne-Twente Workshop on Graphs and Combinatorial Optimization
Dissertation Low Rank Representations of Matrices Using
Graph Theory, an Antiprism Graph Is a Graph That Has One of the Antiprisms As Its Skeleton