Cover Image

Generalized Word-Representable Graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Feng, Zhidan, Fernau, Henning, Fleischmann, Pamela, Mann, Kevin, Sacher, Silas Cato
Format:	Preprint
Published:	2024
Subjects:	Discrete Mathematics 68Q45 05C99 68P30
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Determining Factorial Speed Fast
by: Feng, Zhidan, et al.
Published: (2026)

On Languages Describing Large Graph Classes
by: Fernau, Henning, et al.
Published: (2026)

String attractors of some simple-Parry automatic sequences
by: Gheeraert, France, et al.
Published: (2023)

Faster and shorter synthesis of Hamiltonian simulation circuits
by: de Brugière, Timothée Goubault, et al.
Published: (2024)

Algorithmic counting of nonequivalent compact Huffman codes
by: Elsholtz, Christian, et al.
Published: (2019)

Conformal dimensionality reduction / increase
by: Daras, Nicholas J.
Published: (2025)

Regular $K_3$-irregular graphs
by: Hak, Artem, et al.
Published: (2025)

More algorithmic results for problems of spread of influence in edge-weighted graphs with and without incentives
by: Askari, Siavash, et al.
Published: (2024)

Homomorphically Full Oriented Graphs
by: Bellitto, Thomas, et al.
Published: (2022)

On the joint embedding property for cographs and trees
by: Carter, Daniel
Published: (2024)

Greedy Matchings in Bipartite Graphs with Ordered Vertex Sets
by: Simon, Hans U.
Published: (2024)

Product gales and Finite state dimension
by: S, Akhil
Published: (2025)

BFS versus DFS for random targets in ordered trees
by: Dimitrov, Stoyan, et al.
Published: (2024)

Trifferent codes with small lengths
by: Kurz, Sascha
Published: (2023)

WalkSAT is linear on random 2-SAT
by: Berenbrink, Petra, et al.
Published: (2024)

Pathographs and some (un)decidability results
by: Carter, Daniel, et al.
Published: (2025)

Finding cliques and dense subgraphs using edge queries
by: Csóka, Endre, et al.
Published: (2023)

On sequential structures in incompressible multidimensional networks
by: Abrahão, Felipe S., et al.
Published: (2018)

The random $k$-SAT Gibbs uniqueness threshold revisited
by: Chatterjee, Arnab, et al.
Published: (2025)

Tight eigenvalue bound on the traveling salesman problem
by: Wolff, Lasse H.
Published: (2025)

Bounds on the Twin-Width of Product Graphs
by: Pettersson, William, et al.
Published: (2022)

Edge open packing: complexity, algorithmic aspects, and bounds
by: Brešar, Boštjan, et al.
Published: (2024)

Dissecting power of intersection of two context-free languages
by: Rukavicka, Josef
Published: (2020)

Computational complexity of counting coincidences
by: Chan, Swee Hong, et al.
Published: (2023)

Structure and algorithms for graphs excluding grids with small parity breaks as odd-minors
by: Gollin, J. Pascal, et al.
Published: (2023)

Word-Representability of Graphs with respect to Split Recomposition
by: Dwary, Tithi, et al.
Published: (2024)

From Historical Puzzles to Grammatical Constraints: Circular Partitions, Generalized Run-Length Encodings, and Polynomial-Time Decidability
by: Khormali, Omid, et al.
Published: (2026)

Noisy Linear Group Testing: Exact Thresholds and Efficient Algorithms
by: Hintze, Lukas, et al.
Published: (2024)

Noisy group testing via spatial coupling
by: Coja-Oghlan, Amin, et al.
Published: (2024)

The Existence and Structure of Universal Partial Cycles
by: Fillmore, Dylan, et al.
Published: (2023)

Introducing q-deformed binomial coefficients of words
by: Renard, Antoine, et al.
Published: (2024)

Average Case Analysis of Leaf-Centric Binary Tree Sources
by: Benkner, Louisa Seelbach, et al.
Published: (2018)

Higher-arity PAC learning, VC dimension and packing lemma
by: Chernikov, Artem, et al.
Published: (2025)

Prime Multiple Missing Graphs
by: Ghosh, Shamik
Published: (2025)

Regenerative Ulam-von Neumann Algorithm: An Innovative Markov chain Monte Carlo Method for Matrix Inversion
by: Ghosh, Soumyadip, et al.
Published: (2024)

A quadratic estimation for the Kühnel conjecture on embeddings
by: Dzhenzher, S., et al.
Published: (2022)

Fault-tolerant mutual-visibility: complexity and solutions for grid-like networks
by: Cicerone, Serafino, et al.
Published: (2025)

Exact block encoding of imaginary time evolution with universal quantum neural networks
by: Rrapaj, Ermal, et al.
Published: (2024)

Optimal Hardness of Online Algorithms for Large Independent Sets
by: Gamarnik, David, et al.
Published: (2025)

A short proof of the Patak-Tancer theorem on non-embeddability of $k$-complexes in $2k$-manifolds
by: Kogan, E., et al.
Published: (2021)