Split Graphs with Specified Dilworth Numbers
Canadian mathematical bulletin, Tome 27 (1984) no. 1, pp. 43-47
Voir la notice de l'article provenant de la source Cambridge University Press
Let G be a split graph with the independent part IG and the complete part KG . Suppose that the Dilworth number of (IG, ≼) with respect to the vicinal preorder ≼ is two and that of (KG, ≼) is an integer k. We show that G has a specified graph H k, defined in this paper, as an induced subgraph.
Nara, Chiê; Sato, Iwao. Split Graphs with Specified Dilworth Numbers. Canadian mathematical bulletin, Tome 27 (1984) no. 1, pp. 43-47. doi: 10.4153/CMB-1984-006-6
@article{10_4153_CMB_1984_006_6,
author = {Nara, Chi\^e and Sato, Iwao},
title = {Split {Graphs} with {Specified} {Dilworth} {Numbers}},
journal = {Canadian mathematical bulletin},
pages = {43--47},
year = {1984},
volume = {27},
number = {1},
doi = {10.4153/CMB-1984-006-6},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1984-006-6/}
}
[1] 1. Chvátal, V. and Hammer, P. L., Set-packing problem and threshold graph, Univ. of Waterloo, CORR 73-21, August 1973. Google Scholar
[2] 2. Dilworth, R. P., A decomposition theorem for partially ordered sets, Ann. of Math. 51 (1950), 161-166. Google Scholar
[3] 3. Foldes, S. and Hammer, P. L., Split graphs having Dilworth number two, Can. J. of Math. Vol. 29 (1977), 666-672. Google Scholar
[4] 4. Nara, C., Split graphs with Dilworth number three, Nat. Sci. Rep. Ochanomizu Univ., Vol. 33 (1982), 37-44. Google Scholar
Cité par Sources :