Split Graphs Having Dilworth Number Two

Cited in

(37)

Finding Hamiltonian cycles in \(\{\)quasi-claw, \(K_{1,5},K_{1,5} + e\}\)-free graphs with bounded Dilworth numbers
Split graphs of Dilworth number 2
Generalized neighbourhoods and a class of perfectly orderable graphs
Domination parameters with number 2: interrelations and algorithmic consequences
A counterexample regarding labelled well-quasi-ordering
Efficient enumeration of maximal \(k\)-degenerate induced subgraphs of a chordal graph
Forbidden subgraphs of power graphs
Representing graphs as the intersection of cographs and threshold graphs
On the Lovász-Schrijver PSD-operator on graph classes defined by clique cutsets
The Hamiltonian properties in \(K_{1,r}\)-free split graphs
\((k,l)\)-colourings and Ferrers diagram representations of cographs
Recognition of split-graphic sequences
Graphs with No Induced Five‐Vertex Path or Antipath
Graphs with large obstacle numbers
A unified approach to recognize squares of split graphs
Graphs with maximal induced matchings of the same size
On equistable, split, CIS, and related classes of graphs
Threshold characterization of graphs with dilworth number two
Threshold Sequences
Emergence of a spectral gap in a class of random matrices associated with split graphs
The Dilworth number of auto-chordal bipartite graphs
Labelled well-quasi-order for permutation classes
A finite characterization and recognition of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 in the class of threshold graphs
Isolated scattering number of split graphs and graph products
On Hamiltonian properties of \(K_{1, r}\)-free split graphs
Normal subgroup based power graph of finite groups
Nonsplit Graphs with Split Maximal Induced Subgraphs
Comparing eigenvector and degree dispersion with the principal ratio of a graph
Spanning connectivity of \(K_{1 , r}\)-free split graphs
The clique number of the exact distance t-power graph: complexity and eigenvalue bounds
On the SPANNING k-TREE problem
Bipartite bithreshold graphs
Complete complexity dichotomies for the dominating set problem
Algorithms for the global domination problem
Structural characterizations of tree t-spanners for graphs with few P₄'s and (0, )-graphs
Shallow vertex minors, stability, and dependence
Spanning Fan-connectivity of \(K_{1,r}\)-free split graphs

This page was built for publication: Split Graphs Having Dilworth Number Two

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