1-perfectly orientable \(K_{4}\)-minor-free and outerplanar graphs

DOI10.1016/j.endm.2016.09.035zbMath1356.05025arXiv1604.04598OpenAlexW2964173019MaRDI QIDQ510581

Martin Milanič, Tim Kos, Tatiana Romina Hartinger, Boštjan Brešar

Publication date: 13 February 2017

Full work available at URL: https://arxiv.org/abs/1604.04598

zbMATH Keywords

outerplanar graph\(K_{4}\)-minor-free graph1-perfectly orientable graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

1-perfectly orientable \(K_4\)-minor-free and outerplanar graphs

Cites Work

• Approximation algorithms for intersection graphs
• An algorithm for fraternal orientation of graphs
• In-tournament digraphs
• A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs
• Partial Characterizations of 1‐Perfectly Orientable Graphs
• Unnamed Item

This page was built for publication: 1-perfectly orientable \(K_{4}\)-minor-free and outerplanar graphs