Image de couverture de livre

Word-representability and comparability: Minimal forbidden induced subgraphs and cover number bounds

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Kenkireth, Benny George, Sajith, Gopalan, Sasidharan, Sreyas
Format:	Preprint
Publié:	2025
Sujets:	Discrete Mathematics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On Lexicographic Product and Multi-Word-Representability
par: Kenkireth, Benny George, et autres
Publié: (2026)

List coloring ordered graphs with forbidden induced subgraphs
par: Piecyk, Marta, et autres
Publié: (2025)

Restricted subgraphs of edge-colored graphs and applications
par: Sudakov, Benny
Publié: (2024)

Long induced paths and forbidden patterns: Polylogarithmic bounds
par: Duron, Julien, et autres
Publié: (2024)

Local certification of forbidden subgraphs
par: Bousquet, Nicolas, et autres
Publié: (2024)

On Brooks' Theorem
par: Sajith, Gopalan, et autres
Publié: (2022)

Cops and robber in graphs with bounded vertex cover number
par: Bose, Prosenjit, et autres
Publié: (2026)

Long induced paths in sparse graphs and graphs with forbidden patterns
par: Duron, Julien, et autres
Publié: (2024)

p-complete square-free Word-representation of Word-representable Graphs
par: Das, Biswajit, et autres
Publié: (2025)

Generalizations of Ferber-Krivelevich and Gallai Theorems on parity of degrees in induced subgraphs
par: Ai, Jiangdong, et autres
Publié: (2025)

Compression with wildcards: Enumerating specific induced subgraphs, and packing them as well
par: Wild, Marcel
Publié: (2024)

On the finiteness of $k$-vertex-critical $2P_2$-free graphs with forbidden induced squids or bulls
par: Adekanye, Melvin, et autres
Publié: (2024)

Intersecting families with covering number $3$
par: Kupavskii, Andrey
Publié: (2024)

Edge densities of drawings of graphs with one forbidden cell
par: Hahn, Benedikt, et autres
Publié: (2025)

Rainbow copies of spanning subgraphs
par: Cooper, Colin, et autres
Publié: (2025)

Ensuring connectedness for the Maximum Quasi-clique and Densest $k$-subgraph problems
par: Santos, Daniela Scherer dos, et autres
Publié: (2024)

Representation number of word-representable co-bipartite graph
par: Das, Biswajit, et autres
Publié: (2025)

A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number
par: Pilipczuk, Marcin, et autres
Publié: (2023)

A polynomial bound on the pathwidth of graphs edge-coverable by $k$ shortest paths
par: Baste, Julien, et autres
Publié: (2025)

Distance-based (and path-based) covering problems for graphs of given cyclomatic number
par: Chakraborty, Dibyayan, et autres
Publié: (2025)

New bounds for the optimal density of covering single-insertion codes via the Turán density
par: Pikhurko, Oleg, et autres
Publié: (2024)

Tree decompositions whose trees are subgraphs: An application of Simon's factorization
par: Bourneuf, Romain, et autres
Publié: (2026)

On $(n,m)$-chromatic numbers of graphs having bounded sparsity parameters
par: Das, Sandip, et autres
Publié: (2023)

Immersions of large cliques in graphs with independence number 2 and bounded maximum degree
par: Botler, Fábio, et autres
Publié: (2025)

Fractional coloring with local demands and applications to degree-sequence bounds on the independence number
par: Kelly, Tom, et autres
Publié: (2018)

Upper bounds on the average number of colors in the non-equivalent colorings of a graph
par: Hertz, Alain, et autres
Publié: (2021)

A Caro-Wei bound for induced linear forests in graphs
par: Joret, Gwenaël, et autres
Publié: (2024)

Reconstructing graphs with subgraph compositions
par: Dailly, Antoine, et autres
Publié: (2025)

Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number
par: Jedličková, Nikola, et autres
Publié: (2023)

An algorithm with a delay of $\mathcal{O}(kΔ)$ for enumerating connected induced subgraphs of size $k$
par: Xiao, Chenglong, et autres
Publié: (2024)

A quasi-optimal upper bound for induced paths in sparse graphs
par: Couëtoux, Basile, et autres
Publié: (2025)

Graphs without a partition into two proportionally dense subgraphs
par: Bazgan, Cristina, et autres
Publié: (2018)

Capacitated power dominating set problem: a solution approach based on forbidden propagation sets
par: Lucci, Mauro, et autres
Publié: (2026)

Interval H-graphs : Recognition and forbidden obstructions
par: Müller, Haiko, et autres
Publié: (2025)

Maximum list $r$-colorable induced subgraphs in $kP_3$-free graphs
par: Galby, Esther, et autres
Publié: (2025)

Line Graphs of Non-Word-Representable Graphs are Not Always Non-Word-Representable
par: Mozhui, Khyodeno, et autres
Publié: (2025)

Word-Representation of Melon Graphs
par: Mozhui, Khyodeno, et autres
Publié: (2026)

Word-Representability of Shift Graphs
par: Roy, Suchanda, et autres
Publié: (2026)

Finding Minimal Clusters in st-DAGs
par: Vogl, Ulrich, et autres
Publié: (2026)

The vertex visibility number of graphs
par: Roy, Dhanya, et autres
Publié: (2025)