The solution of two problems on bound polysemy (Q1827754): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.disc.2003.12.010 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2130146230 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3828049 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5750898 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3820628 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On upper bound graphs whose complements are also upper bound graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4860774 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Topics in Intersection Graph Theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some uniqueness results for upper bound graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3039403 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bound graph polysemy / rank | |||
Normal rank |
Latest revision as of 19:26, 6 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The solution of two problems on bound polysemy |
scientific article |
Statements
The solution of two problems on bound polysemy (English)
0 references
6 August 2004
0 references
Bound graph
0 references
Poset
0 references
Polysemy
0 references
Polysemic pair
0 references
Clique
0 references