The splittance of a graph

Cites work

scientific article; zbMATH DE number 3169205 (Why is no real title available?)
scientific article; zbMATH DE number 3182201 (Why is no real title available?)
scientific article; zbMATH DE number 3598234 (Why is no real title available?)
scientific article; zbMATH DE number 3613062 (Why is no real title available?)
scientific article; zbMATH DE number 3632548 (Why is no real title available?)
Graph theory with applications
On Planar Graphical Degree Sequences
On the planarity of regular incidence sequences
Some simplified NP-complete graph problems
Threshold Sequences

Cited in

(only showing first 100 items - show all)

Difference graphs
Editing to Eulerian graphs
Finding disjoint paths in split graphs
A fully dynamic algorithm for modular decomposition and recognition of cographs.
The realization graph of a degree sequence with majorization gap 1 is Hamiltonian
Automated generation of conjectures on forbidden subgraph characterization
On graphs with limited number of \(P_{4}\)-partners
The Grone-Merris conjecture
Faster parameterized algorithms for deletion to split graphs
Co-TT graphs and a characterization of split co-TT graphs
The network flows approach for matrices with given row and column sums
Rainbow colouring of split graphs
Adjacency relationships forced by a degree sequence
Coloring perfect degenerate graphs
On degree sequences and eccentricities in pseudoline arrangement graphs
The complexity of some problems related to GRAPH 3-COLORABILITY
Minimal split completions
On vertex ranking of a starlike graph
On fractional realizations of graph degree sequences
Computing role assignments of split graphs
Split orders
The bipartite-splittance of a bipartite graph
Linear recognition of pseudo-split graphs
Recognizing well covered graphs of families with special \(P _{4}\)-components
Dominating sequences in graphs
On the use of Boolean methods for the computation of the stability number
Non-minimal degree-sequence-forcing triples
Split graphs
LINEAR TIME RECOGNITION AND OPTIMIZATIONS FOR WEAK-BISPLIT GRAPHS, BI-COGRAPHS AND BIPARTITE P₆-FREE GRAPHS
Dynamically maintaining split graphs
Split digraphs
Hereditary unigraphs and Erdős-Gallai equalities
Complexity classification of some edge modification problems
Dominating sets whose closed stars form spanning trees
Groups for which the noncommuting graph is a split graph
scientific article; zbMATH DE number 7651188 (Why is no real title available?)
Minimum edge ranking spanning trees of split graphs
The firefighter problem on graph classes
NP-completeness results for edge modification problems
Fast recognition of doubled graphs
Bipartite graphs totally decomposable by canonical decomposition
Split dimension of graphs
Computing the boxicity of a graph by covering its complement by cointerval graphs
On the interval completion of chordal graphs
Coloring perfect graphs with no balanced skew-partitions
On the Grundy number of graphs with few \(P_4\)'s
Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs
Partitions of graphs into one or two independent sets and cliques
A survey of parameterized algorithms and the complexity of edge modification
Contributions to the theory of graphic sequences
Counting and enumerating independent sets with applications to combinatorial optimization problems
Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs
Hardness of edge-modification problems
On split-coloring problems
Subexponential parameterized algorithms and kernelization on almost chordal graphs
Split graphs: combinatorial species and asymptotics
On the intersection graphs of orthogonal line segments in the plane: characterizations of some subclasses of chordal graphs
About recognizing (\(\alpha\) ,\(\beta\) ) classes of polar graphs
Representations of graphs and networks (coding, layouts and embeddings)
Antimagic labeling and canonical decomposition of graphs
Minimal forbidden sets for degree sequence characterizations
scientific article; zbMATH DE number 2230201 (Why is no real title available?)
Classes of perfect graphs
Win-win kernelization for degree sequence completion problems
Split graphs and Nordhaus-Gaddum graphs
Parameterized complexity of vertex colouring
\(P_{4}\)-laden graphs: A new class of brittle graphs
Degree sequences of matrogenic graphs
The polytope of degree sequences
(Sub)linear kernels for edge modification problems toward structured graph classes
The clique number of the exact distance \(t\)-power graph: complexity and eigenvalue bounds
On vertex-weighted realizations of acyclic and general graphs
Subgraph complementation
Half-graphs, other non-stable degree sequences, and the switch Markov chain
The principal Erdős-Gallai differences of a degree sequence
Algorithmic study on 2-transitivity of graphs
Graph realizations: maximum degree in vertex neighborhoods
The graph of atomic divisors and recognition of finite simple groups
Fully graphic degree sequences and P-stable degree sequences
Relaxed and approximate graph realizations
On two variants of split graphs: 2-unipolar graph and \(k\)-probe-split graph
Maximum rooted connected expansion
An algorithm for coloring some perfect graphs
Weighted efficient domination for \(P_5\)-free and \(P_6\)-free graphs
Cluster deletion on interval graphs and split related graphs
Editing graphs into few cliques: complexity, approximation, and kernelization schemes
Cliques in regular graphs and the core-periphery problem in social networks
Graphs and degree sequences. I
Cluster deletion on interval graphs and split related graphs
Constraints on Brouwer's Laplacian spectrum conjecture
New tools to study 1-11-representation of graphs
Simple groups whose Gruenberg-Kegel graph or solvable graph is split
Recognition of split-graphic sequences
Dichotomy for tree-structured trigraph list homomorphism problems
New classes of degree sequences with fast mixing swap Markov chain sampling
Algorithms for deletion problems on split graphs
A polynomial time algorithm for geodetic hull number for complementary prisms
Split graphs and block representations
Comparing eigenvector and degree dispersion with the principal ratio of a graph
Incompressibility of \(H\)-free edge modification problems: towards a dichotomy

This page was built for publication: The splittance of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1167741)