Characterization of Word-Representable Graphs using Modular Decomposition
Fuente:
arXiv
Saved in:
| Main Authors: | Dwary, Tithi, Krishna, K. V. |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Characterization of Double-Arborescences and their Minimum-Word-Representants
by: Dwary, Tithi, et al.
Published: (2024)
by: Dwary, Tithi, et al.
Published: (2024)
Word-Representability of Well-Partitioned Chordal Graphs
by: Dwary, Tithi, et al.
Published: (2025)
by: Dwary, Tithi, et al.
Published: (2025)
Line Graphs of Non-Word-Representable Graphs are Not Always Non-Word-Representable
by: Mozhui, Khyodeno, et al.
Published: (2025)
by: Mozhui, Khyodeno, et al.
Published: (2025)
Representation Number of Word-Representable Split Graphs
by: Dwary, Tithi, et al.
Published: (2025)
by: Dwary, Tithi, et al.
Published: (2025)
Characterization of Split Comparability Graphs
by: Dwary, Tithi, et al.
Published: (2025)
by: Dwary, Tithi, et al.
Published: (2025)
Word-Representability of Graphs with respect to Split Recomposition
by: Dwary, Tithi, et al.
Published: (2024)
by: Dwary, Tithi, et al.
Published: (2024)
Word-Representation of Melon Graphs
by: Mozhui, Khyodeno, et al.
Published: (2026)
by: Mozhui, Khyodeno, et al.
Published: (2026)
On the Conjecture of the Representation Number of Bipartite Graphs
by: Mozhui, Khyodeno, et al.
Published: (2025)
by: Mozhui, Khyodeno, et al.
Published: (2025)
Forbidden Induced Subgraph Characterization of Word-Representable Split Graphs
by: Srinivasan, Eshwar, et al.
Published: (2025)
by: Srinivasan, Eshwar, et al.
Published: (2025)
Forbidden Induced Subgraph Characterization of Word-Representable Co-bipartite Graphs
by: Srinivasan, Eshwar, et al.
Published: (2025)
by: Srinivasan, Eshwar, et al.
Published: (2025)
Characterization of Word-Representable Near-Triangulations
by: Roy, Suchanda, et al.
Published: (2026)
by: Roy, Suchanda, et al.
Published: (2026)
Word-Representability of Shift Graphs
by: Roy, Suchanda, et al.
Published: (2026)
by: Roy, Suchanda, et al.
Published: (2026)
On the Word-Representability of 5-Regular Circulant Graphs
by: Roy, Suchanda, et al.
Published: (2025)
by: Roy, Suchanda, et al.
Published: (2025)
Network Representation and Modular Decomposition of Combinatorial Structures: A Galled-Tree Perspective
by: Lindeberg, Anna, et al.
Published: (2024)
by: Lindeberg, Anna, et al.
Published: (2024)
Word-Representability of Split Graphs with Independent Set of Size 4
by: Roy, Suchanda, et al.
Published: (2025)
by: Roy, Suchanda, et al.
Published: (2025)
On Lexicographic Product and Multi-Word-Representability
by: Kenkireth, Benny George, et al.
Published: (2026)
by: Kenkireth, Benny George, et al.
Published: (2026)
p-complete square-free Word-representation of Word-representable Graphs
by: Das, Biswajit, et al.
Published: (2025)
by: Das, Biswajit, et al.
Published: (2025)
On Modular Edge Colourings of Graphs
by: Berthe, Gaétan, et al.
Published: (2025)
by: Berthe, Gaétan, et al.
Published: (2025)
On a Characterization of Spartan Graphs
by: Misra, Neeldhara, et al.
Published: (2025)
by: Misra, Neeldhara, et al.
Published: (2025)
Characterization of Circular-arc Graphs: III. Chordal Graphs
by: Cao, Yixin, et al.
Published: (2024)
by: Cao, Yixin, et al.
Published: (2024)
Characterization of Chordal Circular-arc Graphs: I. Split Graphs
by: Cao, Yixin, et al.
Published: (2024)
by: Cao, Yixin, et al.
Published: (2024)
A Characterization of Geodetic Graphs in Terms of their Embedded Even Graphs
by: Frasser, Carlos E.
Published: (2026)
by: Frasser, Carlos E.
Published: (2026)
Computation of Graph Polynomials via Tree Decomposition: Theory, Algorithms, and Python Implementation
by: Bafna, Mehul, et al.
Published: (2025)
by: Bafna, Mehul, et al.
Published: (2025)
On Patterns and Languages in 1-11-Representations of Graphs
by: Das, Biswajit, et al.
Published: (2026)
by: Das, Biswajit, et al.
Published: (2026)
String Graphs: Product Structure and Localised Representations
by: Karol, Nikolai
Published: (2025)
by: Karol, Nikolai
Published: (2025)
Feedback Arc Sets and Feedback Arc Set Decompositions in Weighted and Unweighted Oriented Graphs
by: Gutin, Gregory, et al.
Published: (2025)
by: Gutin, Gregory, et al.
Published: (2025)
Exhaustive Generation of Pattern-Avoiding s-Words
by: Buick, Samuel, et al.
Published: (2025)
by: Buick, Samuel, et al.
Published: (2025)
Net Occurrences in Fibonacci and Thue-Morse Words
by: Guo, Peaker, et al.
Published: (2025)
by: Guo, Peaker, et al.
Published: (2025)
On the Modular Chromatic Index of Random Hypergraphs
by: Carenini, Gaia, et al.
Published: (2025)
by: Carenini, Gaia, et al.
Published: (2025)
Product Structure and Tree-Decompositions
by: Liu, Chun-Hung, et al.
Published: (2024)
by: Liu, Chun-Hung, et al.
Published: (2024)
Characterizing the optimum bases of a convex geometry using quasi-closed hypergraphs
by: Meunier, Anthony, et al.
Published: (2026)
by: Meunier, Anthony, et al.
Published: (2026)
Optimal Tree-Decompositions with Bags of Bounded Treewidth
by: Hendrey, Kevin, et al.
Published: (2025)
by: Hendrey, Kevin, et al.
Published: (2025)
On the $E$-base of Finite Lattices: Semidistributive, Modular, and Geometric Lattices
by: Adaricheva, Kira, et al.
Published: (2025)
by: Adaricheva, Kira, et al.
Published: (2025)
A note on the exact partition polytope of Frieze and Teng
by: Narayanan, Krishna, et al.
Published: (2026)
by: Narayanan, Krishna, et al.
Published: (2026)
Complexity Issues Concerning the Quadruple Roman Domination Problem in Graphs
by: Palagiri, V. S. R., et al.
Published: (2024)
by: Palagiri, V. S. R., et al.
Published: (2024)
Characterizing Large Clique Number in Tournaments
by: Crew, Logan, et al.
Published: (2026)
by: Crew, Logan, et al.
Published: (2026)
Extremal Problems on Forest Cuts and Acyclic Neighborhoods in Sparse Graphs
by: Botler, F., et al.
Published: (2024)
by: Botler, F., et al.
Published: (2024)
Graph Theory
by: Gilbert, Jesse D.
Published: (2011)
by: Gilbert, Jesse D.
Published: (2011)
Characterizing and Transforming DAGs within the I-LCA Framework
by: Hellmuth, Marc, et al.
Published: (2024)
by: Hellmuth, Marc, et al.
Published: (2024)
Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs
by: Bhyravarapu, Sriram, et al.
Published: (2021)
by: Bhyravarapu, Sriram, et al.
Published: (2021)
Similar Items
-
Characterization of Double-Arborescences and their Minimum-Word-Representants
by: Dwary, Tithi, et al.
Published: (2024) -
Word-Representability of Well-Partitioned Chordal Graphs
by: Dwary, Tithi, et al.
Published: (2025) -
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) -
Characterization of Split Comparability Graphs
by: Dwary, Tithi, et al.
Published: (2025)