Split Graphs Having Dilworth Number Two

Cited In (32)

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