Imagen de Portada

p-complete square-free Word-representation of Word-representable Graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Das, Biswajit, Hariharasubramanian, Ramesh
Formato:	Preprint
Publicado:	2025
Materias:	Discrete Mathematics Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Representation number of word-representable co-bipartite graph
por: Das, Biswajit, et al.
Publicado: (2025)

Word-Representability of Shift Graphs
por: Roy, Suchanda, et al.
Publicado: (2026)

On Patterns and Languages in 1-11-Representations of Graphs
por: Das, Biswajit, et al.
Publicado: (2026)

On the Word-Representability of 5-Regular Circulant Graphs
por: Roy, Suchanda, et al.
Publicado: (2025)

Square-free Word-representation of Word-representable Graphs
por: Das, Biswajit, et al.
Publicado: (2024)

Forbidden Induced Subgraph Characterization of Word-Representable Split Graphs
por: Srinivasan, Eshwar, et al.
Publicado: (2025)

Word-Representability of Split Graphs with Independent Set of Size 4
por: Roy, Suchanda, et al.
Publicado: (2025)

Forbidden Induced Subgraph Characterization of Word-Representable Co-bipartite Graphs
por: Srinivasan, Eshwar, et al.
Publicado: (2025)

Characterization of Word-Representable Near-Triangulations
por: Roy, Suchanda, et al.
Publicado: (2026)

Minimum length word-representants of graph products
por: Srinivasan, Eshwar, et al.
Publicado: (2024)

Word-representability of co-bipartite graph
por: Das, Biswajit, et al.
Publicado: (2025)

On semi-transitive orientability of circulant graphs
por: Srinivasan, Eshwar, et al.
Publicado: (2024)

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

Line Graphs of Non-Word-Representable Graphs are Not Always Non-Word-Representable
por: Mozhui, Khyodeno, et al.
Publicado: (2025)

Word-Representation of Melon Graphs
por: Mozhui, Khyodeno, et al.
Publicado: (2026)

Word-Representability of Well-Partitioned Chordal Graphs
por: Dwary, Tithi, et al.
Publicado: (2025)

Representation Number of Word-Representable Split Graphs
por: Dwary, Tithi, et al.
Publicado: (2025)

Characterization of Word-Representable Graphs using Modular Decomposition
por: Dwary, Tithi, et al.
Publicado: (2024)

Exhaustive Generation of Pattern-Avoiding s-Words
por: Buick, Samuel, et al.
Publicado: (2025)

On Lexicographic Product and Multi-Word-Representability
por: Kenkireth, Benny George, et al.
Publicado: (2026)

Net Occurrences in Fibonacci and Thue-Morse Words
por: Guo, Peaker, et al.
Publicado: (2025)

Characterization of Double-Arborescences and their Minimum-Word-Representants
por: Dwary, Tithi, et al.
Publicado: (2024)

A characterization of uniquely representable two-directional orthogonal ray graphs
por: Takaoka, Asahi
Publicado: (2024)

Interaction between skew-representability, tensor products, extension properties, and rank inequalities
por: Bérczi, Kristóf, et al.
Publicado: (2025)

3-colorable planar graphs have an intersection segment representation using 3 slopes
por: Gonçalves, Daniel
Publicado: (2025)

On the Cop Number of String Graphs
por: Das, Sandip, et al.
Publicado: (2024)

On the Complexity of Hop Domination and 2-Step Domination in Graph Classes
por: Das, Sandip, et al.
Publicado: (2026)

Binary Words Containing Few Abelian Squares
por: Fazekas, Szilard Zsolt, et al.
Publicado: (2026)

Computing random $r$-orthogonal Latin squares
por: Bereg, Sergey
Publicado: (2023)

Pseudoperiodic Words and a Question of Shevelev
por: Meleshko, Joseph, et al.
Publicado: (2022)

Faces in rectilinear drawings of complete graphs
por: Balko, Martin, et al.
Publicado: (2025)

Word-representability and comparability: Minimal forbidden induced subgraphs and cover number bounds
por: Kenkireth, Benny George, et al.
Publicado: (2025)

An almost complete $t$-intersection theorem for permutations
por: Kupavskii, Andrey
Publicado: (2024)

Greedy Gray Codes for some Restricted Classes of Binary Words
por: Hassler, Nathanaël, et al.
Publicado: (2024)

Dyck Words, Pattern Avoidance, and Automatic Sequences
por: Mol, Lucas, et al.
Publicado: (2023)

A complete $t$-intersection theorem for families of spanning trees
por: Iarovikova, Elizaveta, et al.
Publicado: (2025)

Local Homophily on Bicolored Graphs is $\mathbf{P}$-complete
por: Concha-Vega, Pablo
Publicado: (2026)

The Smallest String Attractors of Fibonacci and Period-Doubling Words
por: Banbara, Mutsunori, et al.
Publicado: (2026)

A complete solution of the Erdős-Kleitman matching problem for $n\le 3s$
por: Kupavskii, Andrey, et al.
Publicado: (2025)

The sandwich problem for odd-hole-free and even-hole-free graphs
por: Cameron, Kathie, et al.
Publicado: (2024)