The following pages link to Split graphs (Q1873776):
Displaying 38 items.
- Split graphs and Nordhaus-Gaddum graphs (Q297938) (← links)
- Splits of circuits (Q710606) (← links)
- Split digraphs (Q764900) (← links)
- On degree sequences and eccentricities in pseudoline arrangement graphs (Q831726) (← links)
- Operator decomposition of graphs and the reconstruction conjecture (Q960949) (← links)
- Dynamically maintaining split graphs (Q1026107) (← links)
- Adjacency relationships forced by a degree sequence (Q1756108) (← links)
- Threshold graphs and related topics (Q1899209) (← links)
- The principal Erdős-Gallai differences of a degree sequence (Q2075508) (← links)
- The Hamiltonian properties in \(K_{1,r}\)-free split graphs (Q2124619) (← links)
- On split graphs with four distinct eigenvalues (Q2306591) (← links)
- On maximum independent set of categorical product and ultimate categorical ratios of graphs (Q2348262) (← links)
- On the chromatic number of the power graph of a finite group (Q2354776) (← links)
- Neighborhood degree lists of graphs (Q2411614) (← links)
- Connected graphs of fixed order and size with maximal \(A_\alpha \)-index: the one-dominating-vertex case (Q2687249) (← links)
- Reconstructing Cactus Graphs from Shortest Path Information (Q2830066) (← links)
- Degree sequence of tight distance graphs (Q2840558) (← links)
- How to Cut a Graph into Many Pieces (Q3010400) (← links)
- The Grone-Merris Conjecture (Q3020347) (← links)
- (Q3156503) (← links)
- (Q3383645) (← links)
- Splitting digraphs (Q3419770) (← links)
- P-antiregular graphs (Q3439306) (← links)
- A Characterization of the degree sequences of 2-trees (Q3522846) (← links)
- Cutting a graph into two dissimilar halves (Q3801597) (← links)
- Kernelization of Two Path Searching Problems on Split Graphs (Q4632190) (← links)
- Upward-closed hereditary families in the dominance order (Q5024680) (← links)
- D-optimal (0,1)-weighing designs for 10 objects (Q5190347) (← links)
- Split non-threshold Laplacian integral graphs (Q5190352) (← links)
- (Q5315786) (← links)
- Separating a Chart (Q5358393) (← links)
- On Hamiltonian properties of \(K_{1, r}\)-free split graphs (Q6041859) (← links)
- On the complexity of coloring ‐graphs (Q6092550) (← links)
- Complete characterization of the bidegreed split graphs with three or four distinct \(A_{\alpha}\)-eigenvalues (Q6144515) (← links)
- Nonsplit Graphs with Split Maximal Induced Subgraphs (Q6154170) (← links)
- On split graphs with three or four distinct (normalized) Laplacian eigenvalues (Q6188120) (← links)
- Split graphs and block representations (Q6197725) (← links)
- Spanning connectivity of \(K_{1 , r}\)-free split graphs (Q6611066) (← links)
