Copertina

Sparse induced subgraphs in $P_7$-free graphs of bounded clique number

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Chudnovsky, Maria, Czyżewska, Jadwiga, Kluk, Kacper, Pilipczuk, Marcin, Rzążewski, Paweł
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Data Structures and Algorithms Combinatorics
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Faster diameter computation in graphs of bounded Euler genus
di: Kluk, Kacper, et al.
Pubblicazione: (2025)

QPTAS for MWIS and finding large sparse induced subgraphs in graphs with few independent long holes
di: Bonnet, Édouard, et al.
Pubblicazione: (2026)

A note on finding long directed cycles above the minimum degree bound in 2-connected digraphs
di: Czyżewska, Jadwiga, et al.
Pubblicazione: (2025)

Finding large sparse induced subgraphs in graphs of small (but not very small) tree-independence number
di: Lokshtanov, Daniel, et al.
Pubblicazione: (2026)

Tree-independence number VII. Excluding a star
di: Chudnovsky, Maria, et al.
Pubblicazione: (2025)

Max Weight Independent Set in sparse graphs with no long claws
di: Abrishami, Tara, et al.
Pubblicazione: (2023)

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)

On coarse tree decompositions and coarse balanced separators
di: Abrishami, Tara, et al.
Pubblicazione: (2025)

Max Weight Independent Set in graphs with no long claws: An analog of the Gyárfás' path argument
di: Majewski, Konrad, et al.
Pubblicazione: (2022)

Lower bounds on pure dynamic programming for connectivity problems on graphs of bounded path-width
di: Kluk, Kacper, et al.
Pubblicazione: (2025)

Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
di: Bonamy, Marthe, et al.
Pubblicazione: (2022)

Kernelization for list $H$-coloring for graphs with small vertex cover
di: Piecyk, Marta, et al.
Pubblicazione: (2025)

Maximum list $r$-colorable induced subgraphs in $kP_3$-free graphs
di: Galby, Esther, et al.
Pubblicazione: (2025)

Coarse Balanced Separators in Fat-Minor-Free Graphs
di: Bonnet, Édouard, et al.
Pubblicazione: (2026)

Compression with wildcards: All induced metric subgraphs
di: Wild, Marcel
Pubblicazione: (2024)

A Polynomial Coreset for Furthest Neighbor in Planar Metrics
di: Kluk, Kacper, et al.
Pubblicazione: (2026)

Minor Containment and Disjoint Paths in almost-linear time
di: Korhonen, Tuukka, et al.
Pubblicazione: (2024)

Dynamic data structures for twin-ordered matrices
di: Bosek, Bartłomiej, et al.
Pubblicazione: (2026)

Excluding a clique or a biclique in graphs of bounded induced matching treewidth
di: Abrishami, Tara, et al.
Pubblicazione: (2024)

Graphs with no long claws: An improved bound for the analog of the Gyárfás' path argument
di: Bourneuf, Romain, et al.
Pubblicazione: (2025)

An efficient algorithm for $\mathcal{F}$-subgraph-free Edge Deletion on graphs having a product structure
di: An, Shinwoo, et al.
Pubblicazione: (2025)

Cover time of random subgraphs of the hypercube
di: Cooper, Colin, et al.
Pubblicazione: (2025)

Clique-free t-matchings in degree-bounded graphs
di: Paluch, Katarzyna, et al.
Pubblicazione: (2024)

Tree Independence Number IV. Even-hole-free Graphs
di: Chudnovsky, Maria, et al.
Pubblicazione: (2024)

Improved bounds on the zeros of the chromatic polynomial of graphs and claw-free graphs
di: Bencs, Ferenc, et al.
Pubblicazione: (2025)

Induced Cycles of Many Lengths
di: Chudnovsky, Maria, et al.
Pubblicazione: (2026)

Pattern-Sparse Tree Decompositions in $H$-Minor-Free Graphs
di: Marx, Dániel, et al.
Pubblicazione: (2026)

On the complexity of edge subdivision to $H$-free graphs
di: Piecyk, Marta, et al.
Pubblicazione: (2026)

Finding sparse induced subgraphs on graphs of bounded induced matching treewidth
di: Bodlaender, Hans L., et al.
Pubblicazione: (2025)

Lower bounds for graph reconstruction with maximal independent set queries
di: Michel, Lukas, et al.
Pubblicazione: (2024)

Testing H-freeness on sparse graphs, the case of bounded expansion
di: Humeau, Samuel, et al.
Pubblicazione: (2025)

Making an oriented graph acyclic using inversions of bounded or prescribed size
di: Bang-Jensen, Jørgen, et al.
Pubblicazione: (2025)

Sampling and counting triangle-free graphs near the critical density
di: Jenssen, Matthew, et al.
Pubblicazione: (2024)

List homomorphisms by deleting edges and vertices: tight complexity bounds for bounded-treewidth graphs
di: Esmer, Barış Can, et al.
Pubblicazione: (2022)

Erdős-Gyárfás conjecture on graphs without long induced paths
di: Hegde, Anand Shripad, et al.
Pubblicazione: (2024)

Induced Minors and Coarse Tree Decompositions
di: Chudnovsky, Maria, et al.
Pubblicazione: (2026)

Largest common subgraph of two forests
di: Rautenbach, Dieter, et al.
Pubblicazione: (2024)

Graph classes through the lens of logic
di: Pilipczuk, Michał
Pubblicazione: (2025)

Optimal Bounds for Distinct Quartics
di: Charalampopoulos, Panagiotis, et al.
Pubblicazione: (2024)

Maximum Weight Independent Set in Hereditary Classes of Ordered Graphs
di: Bieliński, Paweł Rafał, et al.
Pubblicazione: (2026)