| Title: | Cover-incomparability graphs of posets |
|---|
| Authors: | ID Brešar, Boštjan (Author)
ID Changat, Manoj (Author)
ID Klavžar, Sandi (Author)
ID Kovše, Matjaž (Author)
ID Mathews, Joseph (Author)
ID Mathews, Antony (Author) |
|---|
| Files: |  http://dx.doi.org/10.1007/s11083-008-9097-1
|
|---|
| Language: | English |
|---|
| Work type: | Not categorized |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: | FERI - Faculty of Electrical Engineering and Computer Science
|
|---|
| Abstract: | Vpeljemo graf pokritij-neprimerljivosti (ki mu na kratko rečemo CI-graf), katerega množica povezav je unija množic povezav grafa neprimerljivosti in grafa pokritja dane delno urejene množice. S pomočjo prepovedanih izometričnih delno urejenih podmnožic, okarakteriziramo tiste delno urejene množice, katerih CI-graf je tetiven (razdaljno-hereditaren, ptolemajski) in predlagamo splošen pristop k obravnavi CI-grafov. Predstavimo tudi več odprtih problemov. |
|---|
| Keywords: | matematika, teorija grafov, delno urejena množica, temeljni graf, tranzitna funkcija, tetiven graf, razdaljno-hereditaren graf, mathematics, graph theory, poset, underlying graph, transit function, chordal graph, distance-hereditary graph, claw |
|---|
| Year of publishing: | 2008 |
|---|
| Number of pages: | str. 335-347 |
|---|
| Numbering: | Vol. 25, no. 4 |
|---|
| PID: | 20.500.12556/DKUM-51758  |
|---|
| UDC: | 519.17 |
|---|
| ISSN on article: | 0167-8094 |
|---|
| COBISS.SI-ID: | 15027289 |
|---|
| NUK URN: | URN:SI:UM:DK:ANDEWU72 |
|---|
| Publication date in DKUM: | 10.07.2015 |
|---|
| Views: | 1451 |
|---|
| Downloads: | 105 |
|---|
| Metadata: |    |
|---|
| Categories: | Misc.
|
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
