Split graph
![On J-Colouring of Chithra Graphs Arxiv:1808.08661V1 [Math.GM] 27 Aug 2018](http://data.docslib.org/img/264x/1d8919526cbee85c2db06cbb5e9fdbf2.webp)
![Arxiv:2009.11056V1 [Math.CO] 23 Sep 2020](http://data.docslib.org/img/264x/42b2da049194f99960c46d7f254dda6f.webp)
Top View
- Appendix a Graph Theory Background
- Finding Balance: Split Graphs and Related Classes
- The Hamiltonian Cycle in $ K {1, R} $-Free Split Graphs--A Dichotomy
- Partial Characterization of Graphs Having a Single Large Laplacian Eigenvalue
- Token Sliding on Split Graphs∗
- The A4-Structure of a Graph
- Efficient Algorithms for Graphs with Few P-4'S
- Subgraph Characterization of Red/Blue-Split Graph and K˝Onig Egerv´Ary Graphs
- Complete Bipartite Graph, Tree Graph and Complete Split Graphanalysis Of
- Note a Note on Hamiltonian Split Graphs Split Graphs Were Introduced in [3] Where It Was Shown That These Graphs Have a Simple C
- Split Graphs: Combinatorial Species and Asymptotics
- On the Edge-Colouring of Split Graphs
- Partitions of Graphs Into One Or Two Independent Sets and Cliques
- Linear Recognition of Pseudo-Split Graphs
- Algorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph
- Forbidden Subgraphs of Power Graphs Arxiv:2010.05198V3 [Math.CO]
- On Clique Partitions
- Split Graphs