| | SLO | ENG | Piškotki in zasebnost

Večja pisava | Manjša pisava

Izpis gradiva Pomoč

Naslov:1-perfectly orientable K[sub]4-minor-free and outerplanar graphs
Avtorji:ID Brešar, Boštjan (Avtor)
ID Hartinger, Tatiana Romina (Avtor)
ID Kos, Tim (Avtor)
ID Milanič, Martin (Avtor)
Datoteke:URL https://doi.org/10.1016/j.dam.2017.09.017
 
Jezik:Angleški jezik
Vrsta gradiva:Delo ni kategorizirano
Tipologija:1.01 - Izvirni znanstveni članek
Organizacija:FNM - Fakulteta za naravoslovje in matematiko
Opis: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.
Ključne besede:1-perfectly orientable graph, ▫$K_4$▫-minor-free graph, outerplanar graph
Leto izida:2018
Št. strani:33-45
Številčenje:Vol. 248
PID:20.500.12556/DKUM-78962 Novo okno
UDK:519.17
COBISS.SI-ID:1540044740 Novo okno
DOI:10.1016/j.dam.2017.09.017 Novo okno
ISSN pri članku:0166-218X
Datum objave v DKUM:20.09.2022
Število ogledov:667
Število prenosov:18
Metapodatki:XML DC-XML DC-RDF
Področja:Ostalo
:
Kopiraj citat
  
Skupna ocena:(0 glasov)
Vaša ocena:Ocenjevanje je dovoljeno samo prijavljenim uporabnikom.
Objavi na:Bookmark and Share



Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše podrobnosti ali sproži prenos.

Gradivo je del revije

Naslov:Discrete applied mathematics
Skrajšan naslov:Discrete appl. math.
Založnik:Elsevier
ISSN:0166-218X
COBISS.SI-ID:25342464 Novo okno

Sekundarni jezik

Jezik:Angleški jezik
Ključne besede:1-popolno usmerljiv graf, graf brez ▫$K_4$▫ minorja, zunanje ravninski graf


Komentarji

Dodaj komentar

Za komentiranje se morate prijaviti.

Komentarji (0)
0 - 0 / 0
 
Ni komentarjev!

Nazaj
Logotipi partnerjev Univerza v Mariboru Univerza v Ljubljani Univerza na Primorskem Univerza v Novi Gorici