• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c ≤ 12.

Drago BokalZdenek DvorákPetr HlinenýJesús LeañosBojan MoharTilo Wiedera
Published in: Comb. (2022)
Keyphrases
  • bounded degree
  • graph theoretic
  • graph representation
  • bounded treewidth
  • database
  • graph matching
  • knowledge base
  • np complete