An algorithm for fraternal orientation of graphs
type: Item
instance of: scholarly article
title: An algorithm for fraternal orientation of graphs
zbMATH Open document ID: 0764.68135
DOI: 10.1016/0020-0190(92)90171-Q
author: J. Urrutia
author: Fanica Gavril
published in: Information Processing Letters
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C75
zbMATH DE Number: 92062
zbMATH Keywords: chordal graphs
zbMATH Keywords: polynomial time algorithme
zbMATH Keywords: fraternal orientation
zbMATH Keywords: intersection graphs
MaRDI profile type: Publication
cites work: \(B_ 1\)- and \(B_ 2\)-orientable graphs in kernel theory
cites work: Normal fraternally orientable graphs satisfy the strong perfect graph conjecture
cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs
cites work: Intersection graphs of paths in a tree
cites work: Triangulated graphs and the elimination process
cites work: A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs
full work available at URL: 0020-0190(92)90171-q
OpenAlex ID: W1992312948
description: scientific article; zbMATH DE number 92062