\(1\)-perfectly orientable graphs and graph products

DOI10.1016/j.disc.2016.09.023zbMath1361.05112arXiv1511.07314OpenAlexW2963824799MaRDI QIDQ526271

Martin Milanič, Tatiana Romina Hartinger

Publication date: 10 May 2017

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

structural characterizationCartesian productstrong productdirect productlexicographic product\(1\)-perfectly orientable graphco-chain graphfraternally orientable graphin-tournament digraph

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20) Graph operations (line graphs, products, etc.) (05C76)

Related Items (3)

1-perfectly orientable \(K_4\)-minor-free and outerplanar graphs ⋮ Unnamed Item ⋮ Avoidable vertices and edges in graphs: existence, characterization, and applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation algorithms for intersection graphs
• Fraternal augmentations, arrangeability and linear Ramsey numbers
• Complement reducible graphs
• An algorithm for fraternal orientation of graphs
• Normal fraternally orientable graphs satisfy the strong perfect graph conjecture
• In-tournament digraphs
• Intersection graphs of concatenable subtrees of graphs
• A characterization of normal fraternally orientable perfect graphs
• A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs
• Intersection graphs of proper subtrees of unicyclic graphs

This page was built for publication: \(1\)-perfectly orientable graphs and graph products