| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:1-perfectly orientable K[sub]4-minor-free and outerplanar graphs
Authors:ID Brešar, Boštjan (Author)
ID Hartinger, Tatiana Romina (Author)
ID Kos, Tim (Author)
ID Milanič, Martin (Author)
Files:URL https://doi.org/10.1016/j.dam.2017.09.017
 
Language:English
Work type:Not categorized
Typology:1.01 - Original Scientific Article
Organization:FNM - Faculty of Natural Sciences and Mathematics
Abstract:A graph ▫$G$▫ is said to be 1-perfectly orientable if it has an orientation ▫$D$▫ such that for every vertex ▫$v \in V(G)$▫, the out-neighborhood of ▫$v$▫ in ▫$D$▫ is a clique in ▫$G$▫. D. J. Skrien [J. Graph Theory 6, 309--316 (1982)] posed the problem of characterizing the class of 1-perfectly orientable graphs. This graph class forms a common generalization of the classes of chordal and circular arc graphs; however, while polynomially recognizable via a reduction to 2-SAT, no structural characterization of this intriguing class of graphs is known. Based on a reduction of the study of 1-perfectly orientable graphs to the biconnected case, we characterize, both in terms of forbidden induced minors and in terms of composition theorems, the classes of 1-perfectly orientable ▫$K_4$▫-minor-free graphs and of 1-perfectly orientable outerplanar graphs. As part of our approach, we introduce a class of graphs defined similarly as the class of 2-trees and relate the classes of graphs under consideration to two other graph classes closed under induced minors studied in the literature: cyclically orientable graphs and graphs of separability at most 2.
Keywords:1-perfectly orientable graph, ▫$K_4$▫-minor-free graph, outerplanar graph
Year of publishing:2018
Number of pages:33-45
Numbering:Vol. 248
PID:20.500.12556/DKUM-78962 New window
UDC:519.17
ISSN on article:0166-218X
COBISS.SI-ID:1540044740 New window
DOI:10.1016/j.dam.2017.09.017 New window
Publication date in DKUM:20.09.2022
Views:665
Downloads:18
Metadata:XML DC-XML DC-RDF
Categories:Misc.
:
Copy citation
  
Average score:(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:Discrete applied mathematics
Shortened title:Discrete appl. math.
Publisher:Elsevier
ISSN:0166-218X
COBISS.SI-ID:25342464 New window

Secondary language

Language:English
Keywords:1-popolno usmerljiv graf, graf brez ▫$K_4$▫ minorja, zunanje ravninski graf


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