Cover Image

Compression with wildcards: Enumerating specific induced subgraphs, and packing them as well

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Wild, Marcel
Format:	Preprint
Published:	2024
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Enumerating all geodesics
by: Wild, Marcel
Published: (2024)

Compression with wildcards: All induced metric subgraphs
by: Wild, Marcel
Published: (2024)

List coloring ordered graphs with forbidden induced subgraphs
by: Piecyk, Marta, et al.
Published: (2025)

Generalizations of Ferber-Krivelevich and Gallai Theorems on parity of degrees in induced subgraphs
by: Ai, Jiangdong, et al.
Published: (2025)

Rainbow copies of spanning subgraphs
by: Cooper, Colin, et al.
Published: (2025)

Restricted subgraphs of edge-colored graphs and applications
by: Sudakov, Benny
Published: (2024)

Enumerating Two-Orbit Graphs
by: Seka, David, et al.
Published: (2026)

On arborescence packing augmentation in hypergraphs
by: Hoppenot, Pierre, et al.
Published: (2024)

Composable Constraint Models for Permutation Enumeration
by: Hoffmann, Ruth, et al.
Published: (2023)

Enumeration in the lattice of $q$-decreasing words
by: Baril, Jean-Luc, et al.
Published: (2025)

Edge open packing: further characterizations
by: Pandey, Arti, et al.
Published: (2025)

Tree decompositions whose trees are subgraphs: An application of Simon's factorization
by: Bourneuf, Romain, et al.
Published: (2026)

Enumeration of Sets of Mutually Orthogonal Latin Rectangles
by: Jäger, Gerold, et al.
Published: (2019)

Fast algorithm for $S$-packing coloring of Halin graphs
by: Zhang, Xin, et al.
Published: (2025)

On graph classes with constant domination-packing ratio
by: Bonamy, Marthe, et al.
Published: (2025)

M-convexity of the minimum-cost packings of arborescences
by: Takazawa, Kenjiro
Published: (2018)

Edge open packing on subclasses of chordal graphs
by: Santra, Kamal
Published: (2025)

Regular packing of rooted hyperforests with root constraints in hypergraphs
by: Hoppenot, Pierre, et al.
Published: (2023)

Asymptotically Enumerating Independent Sets in Regular $k$-Partite $k$-Uniform Hypergraphs
by: Arras, Patrick, et al.
Published: (2024)

Reconstructing graphs with subgraph compositions
by: Dailly, Antoine, et al.
Published: (2025)

Enumeration of Tree-like Multigraphs with a Given Number of Vertices, Self-loops and Multiple Edges
by: Azam, Naveed Ahmed, et al.
Published: (2025)

Beyond recognizing well-covered graphs
by: Feghali, Carl, et al.
Published: (2024)

Enumeration of Row-Column Designs
by: Jäger, Gerold, et al.
Published: (2024)

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

Augmenting a hypergraph to have a matroid-based $(f,g)$-bounded $(α,β)$-limited packing of rooted hypertrees
by: Hoppenot, Pierre, et al.
Published: (2024)

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

Clique-width and induced topological minors
by: Bieliński, Paweł Rafał, et al.
Published: (2026)

Long induced paths and forbidden patterns: Polylogarithmic bounds
by: Duron, Julien, et al.
Published: (2024)

A new proof of Delahan's induced-universality result
by: Chappelon, Jonathan
Published: (2026)

Long induced paths in sparse graphs and graphs with forbidden patterns
by: Duron, Julien, et al.
Published: (2024)

A Caro-Wei bound for induced linear forests in graphs
by: Joret, Gwenaël, et al.
Published: (2024)

Dyck Paths Enumerated by the Q-bonacci Numbers
by: Barcucci, Elena, et al.
Published: (2024)

A quasi-optimal upper bound for induced paths in sparse graphs
by: Couëtoux, Basile, et al.
Published: (2025)

Planar induced paths via a decomposition into non-crossing ordered graphs
by: Duron, Julien, et al.
Published: (2025)

On the Enumeration of all Unique Paths of Recombining Trinomial Trees
by: Torres, Ethan, et al.
Published: (2025)

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

Forbidden induced subgraphs in iterative higher order line graphs
by: Sanghi, Aryan, et al.
Published: (2024)

Large induced subgraph with a given pathwidth in outerplanar graphs
by: Matsumoto, Naoki, et al.
Published: (2025)

On the finiteness of $k$-vertex-critical $2P_2$-free graphs with forbidden induced squids or bulls
by: Adekanye, Melvin, et al.
Published: (2024)

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