Cover Image

Characterization of Word-Representable Near-Triangulations

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Roy, Suchanda, Hariharasubramanian, Ramesh
Format:	Preprint
Published:	2026
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

p-complete square-free Word-representation of Word-representable Graphs
by: Das, Biswajit, et al.
Published: (2025)

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

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

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

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

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

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

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

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

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

Connected Dominating Sets in Triangulations
by: Bose, Prosenjit, et al.
Published: (2023)

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

Maximal Independent Sets in Planar Triangulations
by: Francis, P., et al.
Published: (2024)

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

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

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

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

Near Triple Arrays
by: Gordeev, Alexey, et al.
Published: (2025)

On a Characterization of Spartan Graphs
by: Misra, Neeldhara, et al.
Published: (2025)

Characterization of Split Comparability Graphs
by: Dwary, Tithi, et al.
Published: (2025)

Characterizing Large Clique Number in Tournaments
by: Crew, Logan, et al.
Published: (2026)

On the Conjecture of the Representation Number of Bipartite Graphs
by: Mozhui, Khyodeno, et al.
Published: (2025)

Characterizing and Transforming DAGs within the I-LCA Framework
by: Hellmuth, Marc, et al.
Published: (2024)

Characterization of Circular-arc Graphs: III. Chordal Graphs
by: Cao, Yixin, et al.
Published: (2024)

Hypergraphs with Polynomial Representation: Introducing $r$-splits
by: Pitois, François, et al.
Published: (2022)

String Graphs: Product Structure and Localised Representations
by: Karol, Nikolai
Published: (2025)

A Characterization of Geodetic Graphs in Terms of their Embedded Even Graphs
by: Frasser, Carlos E.
Published: (2026)

Characterization of Chordal Circular-arc Graphs: I. Split Graphs
by: Cao, Yixin, et al.
Published: (2024)

Almost Perfect Mutually Unbiased Bases that are Sparse
by: Kumar, Ajeet, et al.
Published: (2024)

Hypergraph Representation via Axis-Aligned Point-Subspace Cover
by: Firman, Oksana, et al.
Published: (2021)

Characterizing the optimum bases of a convex geometry using quasi-closed hypergraphs
by: Meunier, Anthony, et al.
Published: (2026)

Characterizing traces of processes defined by precedence and response constraints: an order theory approach
by: Dukes, Mark, et al.
Published: (2023)

Characterizing optimal monitoring edge-geodetic sets for some structured graph classes
by: Foucaud, Florent, et al.
Published: (2025)

Network Representation and Modular Decomposition of Combinatorial Structures: A Galled-Tree Perspective
by: Lindeberg, Anna, et al.
Published: (2024)

$k$-Leaf Powers Cannot be Characterized by a Finite Set of Forbidden Induced Subgraphs for $k \geq 5$
by: la Tour, Max Dupré, et al.
Published: (2024)