Imagen de Portada

Circular-arc graphs and the Helly property

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Derbisz, Jan, Krawczyk, Tomasz
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A polynomial kernel for vertex deletion into bipartite permutation graphs
por: Derbisz, Jan
Publicado: (2021)

Characterization of Chordal Circular-arc Graphs: I. Split Graphs
por: Cao, Yixin, et al.
Publicado: (2024)

The Complexity of Diameter on H-free graphs
por: Oostveen, Jelle J., et al.
Publicado: (2024)

Generalizing Roberts' characterization of unit interval graphs
por: Martínez, Virginia Ardévol, et al.
Publicado: (2024)

Reconfiguration of labeled matchings in triangular grid graphs
por: Kakimura, Naonori, et al.
Publicado: (2024)

Independent set reconfiguration in H-free graphs
por: Bartier, Valentin, et al.
Publicado: (2024)

Continuous optimization methods for the graph isomorphism problem
por: Klus, Stefan, et al.
Publicado: (2023)

Circle graphs can be recognized in linear time
por: Paul, Christophe, et al.
Publicado: (2025)

Packing $K_r$s in bounded degree graphs
por: McKay, Michael, et al.
Publicado: (2022)

Generation of weighted trees, block trees and block graphs
por: Ekim, Tınaz, et al.
Publicado: (2024)

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

Feedback Vertex Set for pseudo-disk graphs in subexponential FPT time
por: Berthe, Gaétan, et al.
Publicado: (2024)

All ascents exponential from valued constraint graphs of pathwidth three
por: Kaznatcheev, Artem, et al.
Publicado: (2026)

Fast approximation algorithms for the 1-median problem on real-world large graphs
por: Ueta, Keisuke, et al.
Publicado: (2025)

A column generation algorithm for finding co-3-plexes in chordal graphs
por: Dupont-Bouillard, Alexandre
Publicado: (2026)

Polynomial-time algorithms for PATH COVER and PATH PARTITION on trees and graphs of bounded treewidth
por: Foucaud, Florent, et al.
Publicado: (2025)

Generating pivot Gray codes for spanning trees of complete graphs in constant amortized time
por: Liu, Bowie, et al.
Publicado: (2025)

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

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

Interval H-graphs : Recognition and forbidden obstructions
por: Müller, Haiko, et al.
Publicado: (2025)

Rumors on evolving graphs through stationary times
por: Bonasorte, Vicenzo
Publicado: (2025)

Path Cover, Hamiltonicity, and Independence Number: An FPT Perspective
por: Fomin, Fedor V., et al.
Publicado: (2024)

On the Houdré-Tetali conjecture about an isoperimetric constant of graphs
por: Lau, Lap Chi, et al.
Publicado: (2024)

Holey graphs: very large Betti numbers are testable
por: Szabó, Dániel, et al.
Publicado: (2024)

Enumerating minimal solution sets for metric graph problems
por: Bergougnoux, Benjamin, et al.
Publicado: (2023)

Designing sparse temporal graphs satisfying connectivity requirements
por: Bellitto, Thomas, et al.
Publicado: (2026)

Vertex-ordering and arc-partitioning problems
por: Borsik, Nóra A., et al.
Publicado: (2025)

Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions
por: Alecu, Bogdan, et al.
Publicado: (2024)

On the complexity of finding a spanning even tree in a graph
por: Hanaka, Tesshu, et al.
Publicado: (2024)

Quasi-linear distance query reconstruction for graphs of bounded treelength
por: Bastide, Paul, et al.
Publicado: (2024)

Asymptotically faster algorithms for recognizing $(k,\ell)$-sparse graphs
por: Deák, Bence, et al.
Publicado: (2026)

Generating minimal redundant and maximal irredundant sets in incidence graphs
por: Castelo, Emanuel, et al.
Publicado: (2026)

Enumerating minimal dominating sets and variants in chordal bipartite graphs
por: Castelo, Emanuel, et al.
Publicado: (2025)

Sparsest cut and eigenvalue multiplicities on low degree Abelian Cayley graphs
por: d'Orsi, Tommaso, et al.
Publicado: (2024)

Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets
por: Bonamy, Marthe, et al.
Publicado: (2020)

Bounded indegree $k$-forests problem and a faster algorithm for directed graph augmentation
por: Arkhipov, Pavel, et al.
Publicado: (2024)

On the time complexity of finding a well-spread perfect matching in bridgeless cubic graphs
por: Ghanbari, Babak, et al.
Publicado: (2025)

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

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

A characterization of testable hypergraph properties
por: Joos, Felix, et al.
Publicado: (2017)