List coloring ordered graphs with forbidden induced subgraphs

Documenti analoghi

• Polynomial-time recognition and maximum independent set in Burling graphs
  di: Rzążewski, Paweł, et al.
  Pubblicazione: (2024)
• A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number
  di: Pilipczuk, Marcin, et al.
  Pubblicazione: (2023)
• Hitting all longest paths in $H$-free graphs and $H$-graphs
  di: de Lima, Paloma T., et al.
  Pubblicazione: (2025)
• Restricted subgraphs of edge-colored graphs and applications
  di: Sudakov, Benny
  Pubblicazione: (2024)
• Clique-width and induced topological minors
  di: Bieliński, Paweł Rafał, et al.
  Pubblicazione: (2026)