Split (graph theory)
Top View
- Probe Split Graphs Van Bang Le, H
- Weighted and Locally Bounded List-Colorings in Split Graphs, Cographs, and Partial K-Trees Cédric Bentz
- Split Decomposition and Circle Graph Recognition in Quasi-Linear Time
- Circle Graph Isomorphism in Almost Linear Time
- Finding Balance: Split Graphs and Related Classes
- The Multilevel Splitting Algorithm for Graph Coloring with Application to the Potts Model
- Partial Characterization of Graphs Having a Single Large Laplacian Eigenvalue
- 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
- On the Edge-Colouring of Split Graphs
- Partitions of Graphs Into One Or Two Independent Sets and Cliques
- Linear Recognition of Pseudo-Split Graphs
- Clique-Width for Hereditary Graph Classes 2
- On Clique Partitions
- Dynamic Distance Hereditary Graphs Using Split Decomposition*
- A Fully Dynamic Algorithm for Modular Decomposition and Recognition Of
- 1 the Bridges of Konigsberg
- Multi-Clique-Width∗