Imagen de Portada

Generating minimal redundant and maximal irredundant sets in incidence graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Castelo, Emanuel, Chalopin, Jérémie, Defrain, Oscar, Vilmin, Simon
Formato:	Preprint
Publicado:	2026
Materias:	Combinatorics Discrete Mathematics Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

Translating between the representations of an acyclic convex geometry of bounded degree
por: Defrain, Oscar, et al.
Publicado: (2025)

On the enumeration of signatures of XOR-CNF's
por: Creignou, Nadia, et al.
Publicado: (2024)

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

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

Half-space separation in monophonic convexity
por: Elaroussi, Mohammed, et al.
Publicado: (2024)

Isometric path complexity of graphs
por: Chakraborty, Dibyayan, et al.
Publicado: (2022)

Hypergraph dualization with FPT-delay parameterized by the degeneracy and dimension
por: Bartier, Valentin, et al.
Publicado: (2023)

Parameterized complexity of isometric path partition: treewidth and diameter
por: Chakraborty, Dibyayan, et al.
Publicado: (2025)

Polynomial-delay generation of functional digraphs up to isomorphism
por: Defrain, Oscar, et al.
Publicado: (2023)

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

Non-Clashing Teaching Maps for Balls in Graphs
por: Chalopin, Jérémie, et al.
Publicado: (2023)

On the number of $k$-mers admitting a given lexicographical minimizer
por: Ingels, Florian, et al.
Publicado: (2024)

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

Vigemers: on the number of $k$-mers sharing the same XOR-based minimizer
por: Ingels, Florian, et al.
Publicado: (2026)

An unconditional lower bound for the active-set method in convex quadratic maximization
por: Bach, Eleon, et al.
Publicado: (2025)

Efficient algorithms for the Potts model on small-set expanders
por: Carlson, Charles, et al.
Publicado: (2020)

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)

Generalising the maximum independent set algorithm via Boolean networks
por: Gadouleau, Maximilien, et al.
Publicado: (2024)

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

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

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

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)

Sparsest cut and eigenvalue multiplicities on low degree Abelian Cayley graphs
por: d'Orsi, Tommaso, 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)

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

A new width parameter of graphs based on edge cuts: $α$-edge-crossing width
por: Chang, Yeonsu, et al.
Publicado: (2023)

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

Algorithms and complexity for monitoring edge-geodetic sets in graphs
por: Foucaud, Florent, et al.
Publicado: (2024)

Directed Hypercube Routing, a Generalized Lehman-Ron Theorem, and Monotonicity Testing
por: Chakrabarty, Deeparnab, et al.
Publicado: (2024)

Cycle-factors of regular graphs via entropy
por: Christoph, Micha, et al.
Publicado: (2025)

Enumeration of minimal transversals of hypergraphs of bounded VC-dimension
por: Mary, Arnaud
Publicado: (2024)

Induced Cycles of Many Lengths
por: Chudnovsky, Maria, et al.
Publicado: (2026)

Unsplittable Transshipments
por: Debgupta, Srinwanti, et al.
Publicado: (2026)

Weighted Clique and Independent Set in Edge-Distant Hereditary Graphs
por: Srinivasan, Eshwar, et al.
Publicado: (2026)