Quasi-linear distance query reconstruction for graphs of bounded treelength

Documenti analoghi

• Optimal distance query reconstruction for graphs without long induced cycles
  di: Bastide, Paul, et al.
  Pubblicazione: (2023)
• Improved bounds on the zeros of the chromatic polynomial of graphs and claw-free graphs
  di: Bencs, Ferenc, et al.
  Pubblicazione: (2025)
• Clique-free t-matchings in degree-bounded graphs
  di: Paluch, Katarzyna, et al.
  Pubblicazione: (2024)
• Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions
  di: Alecu, Bogdan, et al.
  Pubblicazione: (2024)
• Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets
  di: Bonamy, Marthe, et al.
  Pubblicazione: (2020)