1-perfectly orientable graphs and graph products

DOI10.1016/J.DISC.2016.09.023MaRDI QIDQ526271zbMATH OpenOpenAlexFDO

Authors Tatiana Romina Hartinger, Martin Milanič

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

direct productstrong productCartesian productlexicographic productstructural characterization\(1\)-perfectly orientable graphco-chain graphfraternally orientable graphin-tournament digraph

Mathematics Subject Classification ID

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

Abstract: A graph G is said to be 1-perfectly orientable (1-p.o. for short) if it admits an orientation such that the out-neighborhood of every vertex is a clique in G. The class of 1-p.o. graphs forms a common generalization of the classes of chordal and circular arc graphs. Even though 1-p.o. graphs can be recognized in polynomial time, no structural characterization of 1-p.o. graphs is known. In this paper we consider the four standard graph products: the Cartesian product, the strong product, the direct product, and the lexicographic product. For each of them, we characterize when a nontrivial product of two graphs is 1-p.o.

Recommendations

• Partial characterizations of 1-perfectly orientable graphs
• Orientable domination in product-like graphs
• Pfaffian orientation and enumeration of perfect matchings for some Cartesian products of graphs
• On optimal orientations of Cartesian products of graphs. II: Complete graphs and even cycles
• Strongly perfect products of graphs
• Oriented colouring of some graph products
• scientific article; zbMATH DE number 917749
• Publication:4865480
• Perfect transversal in some graph products
• On optimal orientations of Cartesian products of graphs. I

Cites work

• scientific article; zbMATH DE number 1550912 (Why is no real title available?)
• 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
• An algorithm for fraternal orientation of graphs
• Approximation algorithms for intersection graphs
• Complement reducible graphs
• Fraternal augmentations, arrangeability and linear Ramsey numbers
• Handbook of product graphs
• In-tournament digraphs
• Intersection graphs of concatenable subtrees of graphs
• Intersection graphs of proper subtrees of unicyclic graphs
• Linear-time certifying recognition algorithms and forbidden induced subgraphs
• Normal fraternally orientable graphs satisfy the strong perfect graph conjecture

Cited in

(6)

• On reconfiguration graphs: an abstraction
• Orientable Products in N
• Avoidable vertices and edges in graphs: existence, characterization, and applications
• 1-perfectly orientable \(K_4\)-minor-free and outerplanar graphs
• 1-perfectly orientable \(K_{4}\)-minor-free and outerplanar graphs
• Partial characterizations of 1-perfectly orientable graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q526271)