Split Graphs Having Dilworth Number Two

From MaRDI portal
Publication:4101862

DOI10.4153/CJM-1977-069-1zbMath0335.05130MaRDI QIDQ4101862

Peter L. Hammer, Stephane Foldes

Publication date: 1977

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)




Related Items (30)

Threshold SequencesThe Hamiltonian properties in \(K_{1,r}\)-free split graphsThreshold characterization of graphs with dilworth number twoLabelled well-quasi-order for permutation classesA unified approach to recognize squares of split graphsGeneralized neighbourhoods and a class of perfectly orderable graphsGraphs with maximal induced matchings of the same sizeOn equistable, split, CIS, and related classes of graphsDomination parameters with number 2: interrelations and algorithmic consequencesOn Hamiltonian properties of \(K_{1, r}\)-free split graphsNormal subgroup based power graph of finite groupsNonsplit Graphs with Split Maximal Induced SubgraphsComparing eigenvector and degree dispersion with the principal ratio of a graphEmergence of a spectral gap in a class of random matrices associated with split graphsISOLATED SCATTERING NUMBER OF SPLIT GRAPHS AND GRAPH PRODUCTSGraphs with No Induced Five‐Vertex Path or Antipath\((k,l)\)-colourings and Ferrers diagram representations of cographsThe Dilworth number of auto-chordal bipartite graphsEfficient enumeration of maximal \(k\)-degenerate induced subgraphs of a chordal graphA finite characterization and recognition of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 in the class of threshold graphsOn the SPANNING \(k\)-TREE problemBipartite bithreshold graphsA counterexample regarding labelled well-quasi-orderingRecognition of split-graphic sequencesGraphs with Large Obstacle NumbersForbidden subgraphs of power graphsRepresenting graphs as the intersection of cographs and threshold graphsFinding Hamiltonian cycles in \(\{\)quasi-claw, \(K_{1,5},K_{1,5} + e\}\)-free graphs with bounded Dilworth numbersOn the Lovász-Schrijver PSD-operator on graph classes defined by clique cutsetsSplit graphs of Dilworth number 2




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