Split Graphs Having Dilworth Number Two
From MaRDI portal
Publication:4101862
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 equistable, split, CIS, and related classes of graphs
- On Hamiltonian properties of \(K_{1, r}\)-free split graphs
- On the Lovász-Schrijver PSD-operator on graph classes defined by clique cutsets
- \((k,l)\)-colourings and Ferrers diagram representations of cographs
- Forbidden subgraphs of power graphs
- The Hamiltonian properties in \(K_{1,r}\)-free split graphs
- Nonsplit Graphs with Split Maximal Induced Subgraphs
- A counterexample regarding labelled well-quasi-ordering
- On the SPANNING k-TREE problem
- Recognition of split-graphic sequences
- Labelled well-quasi-order for permutation classes
- A unified approach to recognize squares of split graphs
- Spanning connectivity of \(K_{1 , r}\)-free 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
- Threshold Sequences
- The clique number of the exact distance \(t\)-power graph: complexity and eigenvalue bounds
- 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
- Generalized neighbourhoods and a class of perfectly orderable graphs
- Isolated scattering number of split graphs and graph products
- 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)