A survey of complexity results and open problems for independent set, vertex cover, coloring, and treewidth on continuous graphs, with a new upper bound for the coloring number of complete continuous graphs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Combinatorial properties of continuous graphs: A survey of challenges, solutions and open problems
A survey of complexity results and open problems for independent set, vertex cover, coloring, and treewidth on continuous graphs, with a new upper bound for the coloring number of complete continuous graphs.