The following pages link to The splittance of a graph (Q1167741):
Displayed 49 items.
- Fast recognition of doubled graphs (Q385965) (← links)
- Hereditary unigraphs and Erdős-Gallai equalities (Q389468) (← links)
- The polytope of degree sequences (Q584289) (← links)
- Computing the boxicity of a graph by covering its complement by cointerval graphs (Q585228) (← links)
- Split digraphs (Q764900) (← links)
- Degree sequences of matrogenic graphs (Q797597) (← links)
- Minimum edge ranking spanning trees of split graphs (Q860397) (← links)
- Minimal split completions (Q967310) (← links)
- Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs (Q972334) (← links)
- Antimagic labeling and canonical decomposition of graphs (Q991774) (← links)
- On split-coloring problems (Q995923) (← links)
- Dynamically maintaining split graphs (Q1026107) (← links)
- Hardness of edge-modification problems (Q1034612) (← links)
- The network flows approach for matrices with given row and column sums (Q1052337) (← links)
- About recognizing (\(\alpha\) ,\(\beta\) ) classes of polar graphs (Q1084418) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- Split dimension of graphs (Q1176734) (← links)
- Contributions to the theory of graphic sequences (Q1199499) (← links)
- The complexity of some problems related to GRAPH 3-COLORABILITY (Q1281385) (← links)
- The realization graph of a degree sequence with majorization gap 1 is Hamiltonian (Q1300907) (← links)
- Linear recognition of pseudo-split graphs (Q1331889) (← links)
- \(P_{4}\)-laden graphs: A new class of brittle graphs (Q1349998) (← links)
- Coloring perfect degenerate graphs (Q1356545) (← links)
- Dominating sets whose closed stars form spanning trees (Q1357724) (← links)
- On the use of Boolean methods for the computation of the stability number (Q1363750) (← links)
- An algorithm for coloring some perfect graphs (Q1382811) (← links)
- Split orders (Q1422429) (← links)
- A fully dynamic algorithm for modular decomposition and recognition of cographs. (Q1427188) (← links)
- On vertex ranking of a starlike graph (Q1603539) (← links)
- On the Grundy number of graphs with few \(P_4\)'s (Q1759824) (← links)
- Parameterized complexity of vertex colouring (Q1811065) (← links)
- On forcibly hereditary P-graphical sequences (Q1820175) (← links)
- Split graphs (Q1873776) (← links)
- Partitions of graphs into one or two independent sets and cliques (Q1917483) (← links)
- Dichotomy for tree-structured trigraph list homomorphism problems (Q2275926) (← links)
- On the intersection graphs of orthogonal line segments in the plane: characterizations of some subclasses of chordal graphs (Q2376078) (← links)
- Recognizing well covered graphs of families with special \(P _{4}\)-components (Q2376085) (← links)
- Classes of perfect graphs (Q2433714) (← links)
- On the interval completion of chordal graphs (Q2492201) (← links)
- NP-completeness results for edge modification problems (Q2500532) (← links)
- Degree Sequence of Tight Distance Graphs (Q2840558) (← links)
- The Grone-Merris Conjecture (Q3020347) (← links)
- A Characterization of the degree sequences of 2-trees (Q3522846) (← links)
- Graphs and degree sequences. I (Q3803156) (← links)
- Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs (Q5387822) (← links)
- LINEAR TIME RECOGNITION AND OPTIMIZATIONS FOR WEAK-BISPLIT GRAPHS, BI-COGRAPHS AND BIPARTITE P<sub>6</sub>-FREE GRAPHS (Q5696896) (← links)
- (Q5708487) (← links)
- Difference graphs (Q5895304) (← links)
- Complexity classification of some edge modification problems (Q5948964) (← links)