General Strong Bound on the Uncrossed Number via a Tight Bound for the Maximum Uncrossed Subgraph Number

Documenti analoghi

• On the Uncrossed Number of Graphs
  di: Balko, Martin, et al.
  Pubblicazione: (2024)
• Minimizing an Uncrossed Collection of Drawings
  di: Hliněný, Petr, et al.
  Pubblicazione: (2023)
• Some Counterexamples for Compatible Triangulations
  di: Barnson, Cody, et al.
  Pubblicazione: (2016)
• Well-Quasi-Ordering Eulerian Digraphs: Bounded Carving Width
  di: Cavallaro, Dario, et al.
  Pubblicazione: (2026)
• A Tight Meta-theorem for LOCAL Certification of MSO$_2$ Properties within Bounded Treewidth Graphs
  di: Cook, Linda, et al.
  Pubblicazione: (2025)