graph theory, a branch of mathematics, a split graph is a graph in which the vertices can be partitioned into a clique and an independent set. Split graphs...

In graph theory, a split of an undirected graph is a cut whose cut-set forms a complete bipartite graph. A graph is prime if it has no splits. The splits...

In graph theory, a perfect graph is a graph in which the chromatic number equals the size of the maximum clique, both in the graph itself and in every...

Appendix:Glossary of graph theory in Wiktionary, the free dictionary. This is a glossary of graph theory. Graph theory is the study of graphs, systems of nodes...

In graph theory, the strong perfect graph theorem is a forbidden graph characterization of the perfect graphs as being exactly the graphs that have neither...

cover. A perfect graph is a graph in which the clique number equals the chromatic number in every induced subgraph. A split graph is a graph in which some...

Bivariegated graph Cage (graph theory) Cayley graph Circle graph Clique graph Cograph Common graph Complement of a graph Complete graph Cubic graph Cycle graph De...

In the mathematical field of graph theory, a bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint and independent sets...

In the mathematical area of graph theory, a chordal graph is one in which all cycles of four or more vertices have a chord, which is an edge that is not...

In graph theory, a branch of mathematics, many important families of graphs can be described by a finite set of individual graphs that do not belong to...

destroyer Split, decommissioned in 1980 Yugoslav frigate Split, Koni-class Split (graph theory) Split (mathematics), a property of an exact sequence Split Lie...

In the mathematical field of graph theory, a word-representable graph is a graph that can be characterized by a word (or sequence) whose entries alternate...

comparability graph, it follows that graph and its complement are both interval graphs if and only if the graph is both a split graph and a permutation graph. The...

in the tree. Connectivity (graph theory) Graph cuts in computer vision Split (graph theory) Vertex separator Bridge (graph theory) Cutwidth "NetworkX...

self-complementary graph, a block graph, a split graph, an interval graph, a claw-free graph, a 1-vertex-connected graph and a 1-edge-connected graph. A graph is bull-free...

In graph theory, a branch of mathematics, the splittance of an undirected graph measures its distance from a split graph. A split graph is a graph whose...

In the mathematical field of graph theory, the complement or inverse of a graph G is a graph H on the same vertices such that two distinct vertices of...

bounded-degree planar graphs, split graphs, bipartite graphs and their complements, line graphs of bipartite graphs, unit disk graphs, interval graphs of diameter...

and a split graph. Every graph that is both a trivially perfect graph and the complementary graph of a trivially perfect graph is a threshold graph. Threshold...

tripartite graph K1,1,p. It is a graph consisting of p {\displaystyle p} triangles sharing a common edge. A book of this type is a split graph. This graph has...

cocolorings of G. The graphs with cochromatic number 2 are exactly the bipartite graphs, complements of bipartite graphs, and split graphs. As the requirement...

In graph theory, trapezoid graphs are intersection graphs of trapezoids between two horizontal lines. They are a class of co-comparability graphs that...

bipartite Eulerian graphs bipartite regular graphs line graphs split graphs chordal graphs regular self-complementary graphs polytopal graphs of general, simple...

Trap–bath split An example of the trap–bath split Problems playing this file? See media help. The TRAP–BATH split is a vowel split that occurs mainly in...

In the mathematical field of graph theory, a graph G is symmetric or arc-transitive if, given any two ordered pairs of adjacent vertices ( u 1 , v 1 )...

"Books", an episode from Ben & Holly's Little Kingdom Book (graph theory), a split graph consisting of p triangles sharing a common edge Book (wagering)...

In graph theory, a dominating set for a graph G is a subset D of its vertices, such that any vertex of G is in D, or has a neighbor in D. The domination...

In the mathematical area of graph theory, a chordal bipartite graph is a bipartite graph B = (X,Y,E) in which every cycle of length at least 6 in B has...

In computer science, a control-flow graph (CFG) is a representation, using graph notation, of all paths that might be traversed through a program during...

"Remembering Roger Craig, Sage of the Split-Fingered Fastball (1930–2023)". FanGraphs. Retrieved May 24, 2025. "Who Invented the Split Finger Fastball: A Journey...