| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

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:URL 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 New window
UDC:519.17
ISSN on article:0167-8094
COBISS.SI-ID:15027289 New window
NUK URN:URN:SI:UM:DK:ANDEWU72
Publication date in DKUM:10.07.2015
Views:1211
Downloads:102
Metadata:XML DC-XML DC-RDF
Categories:Misc.
:
BREŠAR, Boštjan, CHANGAT, Manoj, KLAVŽAR, Sandi, KOVŠE, Matjaž, MATHEWS, Joseph and MATHEWS, Antony, 2008, Cover-incomparability graphs of posets. Order [online]. 2008. Vol. 25, no. 4, p. 335–347. [Accessed 17 March 2025]. Retrieved from: http://dx.doi.org/10.1007/s11083-008-9097-1
Copy citation
  
Average score:
0.5
1
1.5
2
2.5
3
3.5
4
4.5
5
(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share


Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:Order
Shortened title:Order
Publisher:Reidel
ISSN:0167-8094
COBISS.SI-ID:26073856 New window

Secondary language

Language:Unknown
Abstract:Cover-incomparability graphs (C-I graphs, for short) are introduced, whose edge-set is the union of edge-sets of the incomparability and the cover graph of a poset. Posets whose C-I graphs are chordal (resp. distance-hereditary, Ptolemaic) are characterized in terms of forbidden isometric subposets, and a general approach for studying C-I graphs is proposed. Several open problems are also stated.


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica