Excluding a clique or a biclique in graphs of bounded induced matching treewidth
Fuente:
arXiv
Guardado en:
| Autores principales: | Abrishami, Tara, Briański, Marcin, Czyżewska, Jadwiga, McCarty, Rose, Milanič, Martin, Rzążewski, Paweł, Walczak, Bartosz |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Sparse induced subgraphs in $P_7$-free graphs of bounded clique number
por: Chudnovsky, Maria, et al.
Publicado: (2024)
por: Chudnovsky, Maria, et al.
Publicado: (2024)
Tree-independence number VII. Excluding a star
por: Chudnovsky, Maria, et al.
Publicado: (2025)
por: Chudnovsky, Maria, et al.
Publicado: (2025)
Burling graphs in graphs with large chromatic number
por: Abrishami, Tara, et al.
Publicado: (2025)
por: Abrishami, Tara, et al.
Publicado: (2025)
On coarse tree decompositions and coarse balanced separators
por: Abrishami, Tara, et al.
Publicado: (2025)
por: Abrishami, Tara, et al.
Publicado: (2025)
Induced matching treewidth and tree-independence number, revisited
por: Alon, Noga, et al.
Publicado: (2025)
por: Alon, Noga, et al.
Publicado: (2025)
Clique-width and induced topological minors
por: Bieliński, Paweł Rafał, et al.
Publicado: (2026)
por: Bieliński, Paweł Rafał, et al.
Publicado: (2026)
A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number
por: Pilipczuk, Marcin, et al.
Publicado: (2023)
por: Pilipczuk, Marcin, et al.
Publicado: (2023)
Polynomial-time recognition and maximum independent set in Burling graphs
por: Rzążewski, Paweł, et al.
Publicado: (2024)
por: Rzążewski, Paweł, et al.
Publicado: (2024)
Decomposing a signed graph into rooted circuits
por: McCarty, Rose
Publicado: (2023)
por: McCarty, Rose
Publicado: (2023)
Tree-independence number of $P_5$-free graphs with no large bicliques
por: Blažej, Václav, et al.
Publicado: (2026)
por: Blažej, Václav, et al.
Publicado: (2026)
QPTAS for MWIS and finding large sparse induced subgraphs in graphs with few independent long holes
por: Bonnet, Édouard, et al.
Publicado: (2026)
por: Bonnet, Édouard, et al.
Publicado: (2026)
Induced subgraphs and tree decompositions X. Towards logarithmic treewidth for even-hole-free graphs
por: Abrishami, Tara, et al.
Publicado: (2023)
por: Abrishami, Tara, et al.
Publicado: (2023)
Strongly sublinear separators and bounded asymptotic dimension for sphere intersection graphs
por: Davies, James, et al.
Publicado: (2025)
por: Davies, James, et al.
Publicado: (2025)
Induced subgraphs and tree decompositions VIII. Excluding a forest in (theta, prism)-free graphs
por: Abrishami, Tara, et al.
Publicado: (2023)
por: Abrishami, Tara, et al.
Publicado: (2023)
Universality for graphs with bounded density
por: Alon, Noga, et al.
Publicado: (2023)
por: Alon, Noga, et al.
Publicado: (2023)
A survey of degree-boundedness
por: Du, Xiying, et al.
Publicado: (2024)
por: Du, Xiying, et al.
Publicado: (2024)
List coloring ordered graphs with forbidden induced subgraphs
por: Piecyk, Marta, et al.
Publicado: (2025)
por: Piecyk, Marta, et al.
Publicado: (2025)
The structure of group-labeled graphs forbidding an immersion
por: McCarty, Rose, et al.
Publicado: (2026)
por: McCarty, Rose, et al.
Publicado: (2026)
The global structure of locally chordal graphs
por: Abrishami, Tara, et al.
Publicado: (2025)
por: Abrishami, Tara, et al.
Publicado: (2025)
Odd coloring graphs with linear neighborhood complexity
por: Davies, James, et al.
Publicado: (2025)
por: Davies, James, et al.
Publicado: (2025)
Prime and polynomial distances in colourings of the plane
por: Davies, James, et al.
Publicado: (2023)
por: Davies, James, et al.
Publicado: (2023)
Induced subgraphs and tree decompositions XV. Even-hole-free graphs with bounded clique number have logarithmic treewidth
por: Chudnovsky, Maria, et al.
Publicado: (2024)
por: Chudnovsky, Maria, et al.
Publicado: (2024)
Quantum state systems that count perfect matchings
por: Baldridge, Scott, et al.
Publicado: (2024)
por: Baldridge, Scott, et al.
Publicado: (2024)
Graphs that are quasi-isometric to graphs with bounded treewidth
por: Hickingbotham, Robert
Publicado: (2025)
por: Hickingbotham, Robert
Publicado: (2025)
Even pairs in Berge graphs with no balanced skew-partitions
por: Abrishami, Tara, et al.
Publicado: (2023)
por: Abrishami, Tara, et al.
Publicado: (2023)
Constant congestion brambles in directed graphs
por: Masařík, Tomáš, et al.
Publicado: (2021)
por: Masařík, Tomáš, et al.
Publicado: (2021)
A note on finding long directed cycles above the minimum degree bound in 2-connected digraphs
por: Czyżewska, Jadwiga, et al.
Publicado: (2025)
por: Czyżewska, Jadwiga, et al.
Publicado: (2025)
Fat minors cannot be thinned (by quasi-isometries)
por: Davies, James, et al.
Publicado: (2024)
por: Davies, James, et al.
Publicado: (2024)
An alternative characterisation of graphs quasi-isometric to graphs of bounded treewidth
por: Distel, Marc
Publicado: (2025)
por: Distel, Marc
Publicado: (2025)
An improved quasi-isometry between graphs of bounded cliquewidth and graphs of bounded treewidth
por: Distel, Marc
Publicado: (2025)
por: Distel, Marc
Publicado: (2025)
Induced Ramsey problems for trees and graphs with bounded treewidth
por: Hunter, Zach, et al.
Publicado: (2024)
por: Hunter, Zach, et al.
Publicado: (2024)
Tree-independence number and forbidden induced subgraphs: excluding a $6$-vertex path and a $(2,t)$-biclique
por: Chudnovsky, Maria, et al.
Publicado: (2026)
por: Chudnovsky, Maria, et al.
Publicado: (2026)
Excluding an induced wheel minor in graphs without large induced stars
por: Choi, Mujin, et al.
Publicado: (2025)
por: Choi, Mujin, et al.
Publicado: (2025)
Girth in $GF(q)$-representable matroids
por: Davies, James, et al.
Publicado: (2025)
por: Davies, James, et al.
Publicado: (2025)
Max Weight Independent Set in sparse graphs with no long claws
por: Abrishami, Tara, et al.
Publicado: (2023)
por: Abrishami, Tara, et al.
Publicado: (2023)
Submodular functions and perfect graphs
por: Abrishami, Tara, et al.
Publicado: (2021)
por: Abrishami, Tara, et al.
Publicado: (2021)
On treewidth and maximum cliques
por: Chudnovsky, Maria, et al.
Publicado: (2024)
por: Chudnovsky, Maria, et al.
Publicado: (2024)
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
por: Bonamy, Marthe, et al.
Publicado: (2022)
por: Bonamy, Marthe, et al.
Publicado: (2022)
Erdős-Pósa property of tripods in directed graphs
por: Briański, Marcin, et al.
Publicado: (2024)
por: Briański, Marcin, et al.
Publicado: (2024)
Finding large $k$-colorable induced subgraphs in (bull, chair)-free and (bull,E)-free graphs
por: Hodur, Nadzieja, et al.
Publicado: (2025)
por: Hodur, Nadzieja, et al.
Publicado: (2025)
Ejemplares similares
-
Sparse induced subgraphs in $P_7$-free graphs of bounded clique number
por: Chudnovsky, Maria, et al.
Publicado: (2024) -
Tree-independence number VII. Excluding a star
por: Chudnovsky, Maria, et al.
Publicado: (2025) -
Burling graphs in graphs with large chromatic number
por: Abrishami, Tara, et al.
Publicado: (2025) -
On coarse tree decompositions and coarse balanced separators
por: Abrishami, Tara, et al.
Publicado: (2025) -
Induced matching treewidth and tree-independence number, revisited
por: Alon, Noga, et al.
Publicado: (2025)