MathDBFinite graph characterization conjecture for good slope sets
Finite graph characterization conjecture for good slope sets
A good set of slopes is a set with which every cubic graph has a straight-line drawing. Finite graph characterization conjecture. There is a not necessarily connected finite graph such that a set of slopes is good if and only if this graph has a straight-line drawing with them. This conjecture asks whether goodness of a slope set can be characterized by drawing a single finite graph; the source does not provide a resolution.
Sources & referencesView supporting material
Primary source
Padmini Mukkamala and Dömötör Pálvölgyi, “Drawing cubic graphs with the four basic slopes”, arXiv:1106.1973 (2011).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.