Image de couverture de livre

Word-Representability of Split Graphs with Independent Set of Size 4

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Roy, Suchanda, Hariharasubramanian, Ramesh
Format:	Preprint
Publié:	2025
Sujets:	Combinatorics Discrete Mathematics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

On the Word-Representability of 5-Regular Circulant Graphs
par: Roy, Suchanda, et autres
Publié: (2025)

Characterization of Word-Representable Near-Triangulations
par: Roy, Suchanda, et autres
Publié: (2026)

Forbidden Induced Subgraph Characterization of Word-Representable Split Graphs
par: Srinivasan, Eshwar, et autres
Publié: (2025)

Forbidden Induced Subgraph Characterization of Word-Representable Co-bipartite Graphs
par: Srinivasan, Eshwar, et autres
Publié: (2025)

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

Weighted Clique and Independent Set in Edge-Distant Hereditary Graphs
par: Srinivasan, Eshwar, et autres
Publié: (2026)

On Patterns and Languages in 1-11-Representations of Graphs
par: Das, Biswajit, et autres
Publié: (2026)

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

Minimum length word-representants of graph products
par: Srinivasan, Eshwar, et autres
Publié: (2024)

On semi-transitive orientability of circulant graphs
par: Srinivasan, Eshwar, et autres
Publié: (2024)

Representation Number of Word-Representable Split Graphs
par: Dwary, Tithi, 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 Well-Partitioned Chordal Graphs
par: Dwary, Tithi, et autres
Publié: (2025)

Characterization of Word-Representable Graphs using Modular Decomposition
par: Dwary, Tithi, et autres
Publié: (2024)

Maximal Independent Sets in Planar Triangulations
par: Francis, P., et autres
Publié: (2024)

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

Characterization of Double-Arborescences and their Minimum-Word-Representants
par: Dwary, Tithi, et autres
Publié: (2024)

Characterization of Split Comparability Graphs
par: Dwary, Tithi, et autres
Publié: (2025)

Characterization of Chordal Circular-arc Graphs: I. Split Graphs
par: Cao, Yixin, et autres
Publié: (2024)

Exact Biclique Partition number of Split Graphs
par: Babu, Anand, et autres
Publié: (2025)

Asymptotically Enumerating Independent Sets in Regular $k$-Partite $k$-Uniform Hypergraphs
par: Arras, Patrick, et autres
Publié: (2024)

Exploring Algorithmic Solutions for the Independent Roman Domination Problem in Graphs
par: Paul, Kaustav, et autres
Publié: (2024)

Odd-Cycle-Packing-treewidth: On the Maximum Independent Set problem in odd-minor-free graph classes
par: Choi, Mujin, et autres
Publié: (2025)

Face-hitting Dominating Sets in Planar Graphs
par: Francis, P., et autres
Publié: (2024)

Feedback Arc Sets and Feedback Arc Set Decompositions in Weighted and Unweighted Oriented Graphs
par: Gutin, Gregory, et autres
Publié: (2025)

Cliques, Chromatic Number, and Independent Sets in the Semi-random Process
par: Gamarnik, David, et autres
Publié: (2023)

On the Conjecture of the Representation Number of Bipartite Graphs
par: Mozhui, Khyodeno, et autres
Publié: (2025)

Backward Arcs in Hamilton Oriented Cycles and Paths in Directed Graphs with Independence Number Two
par: Gerke, S., et autres
Publié: (2026)

Size-4 Counterexamples to the Sidon-Extension Conjecture
par: Niu, Tong
Publié: (2026)

String Graphs: Product Structure and Localised Representations
par: Karol, Nikolai
Publié: (2025)

Theoretical and Computational Approaches to Determining Sets of Orders for $(k,g)$-Graphs
par: Eze, L. C., et autres
Publié: (2025)

Partitioning Complete Geometric Graphs on Dense Point Sets into Plane Subgraphs
par: Dumitrescu, Adrian, et autres
Publié: (2024)

Exhaustive Generation of Pattern-Avoiding s-Words
par: Buick, Samuel, et autres
Publié: (2025)

A Survey of Cameron-Liebler Sets and Low Degree Boolean Functions in Grassmann Graphs
par: Ihringer, Ferdinand
Publié: (2024)

Completely Independent Steiner Trees
par: Maheshwari, Anil, et autres
Publié: (2026)

Bears with Hats and Independence Polynomials
par: Blažej, Václav, et autres
Publié: (2021)

Net Occurrences in Fibonacci and Thue-Morse Words
par: Guo, Peaker, et autres
Publié: (2025)

Stable Approximation Algorithms for Dominating Set and Independent Set
par: de Berg, Mark, et autres
Publié: (2024)