The following pages link to The splittance of a graph (Q1167741):
Displaying 50 items.
- Computing role assignments of split graphs (Q287443) (← links)
- Win-win kernelization for degree sequence completion problems (Q295647) (← links)
- Split graphs and Nordhaus-Gaddum graphs (Q297938) (← links)
- Rainbow colouring of split graphs (Q344835) (← links)
- Fast recognition of doubled graphs (Q385965) (← links)
- Hereditary unigraphs and Erdős-Gallai equalities (Q389468) (← links)
- On fractional realizations of graph degree sequences (Q405210) (← links)
- Coloring perfect graphs with no balanced skew-partitions (Q490982) (← links)
- Finding disjoint paths in split graphs (Q493652) (← links)
- Non-minimal degree-sequence-forcing triples (Q497308) (← links)
- The polytope of degree sequences (Q584289) (← links)
- Computing the boxicity of a graph by covering its complement by cointerval graphs (Q585228) (← links)
- Dominating sequences in graphs (Q740654) (← links)
- Automated generation of conjectures on forbidden subgraph characterization (Q741737) (← links)
- Split digraphs (Q764900) (← links)
- Counting and enumerating independent sets with applications to combinatorial optimization problems (Q784784) (← links)
- Degree sequences of matrogenic graphs (Q797597) (← links)
- On degree sequences and eccentricities in pseudoline arrangement graphs (Q831726) (← links)
- Minimum edge ranking spanning trees of split graphs (Q860397) (← links)
- Editing to Eulerian graphs (Q896016) (← links)
- The firefighter problem on graph classes (Q899308) (← 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)
- The bipartite-splittance of a bipartite graph (Q1630919) (← links)
- Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs (Q1678166) (← links)
- Finding balance: split graphs and related classes (Q1753048) (← links)
- Adjacency relationships forced by a degree sequence (Q1756108) (← 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)
