An algorithm for fraternal orientation of graphs
From MaRDI portal
Publication:1197981
DOI10.1016/0020-0190(92)90171-QzbMath0764.68135OpenAlexW1992312948MaRDI QIDQ1197981
Publication date: 16 January 1993
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(92)90171-q
Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (14)
Intersection graphs of concatenable subtrees of graphs ⋮ \(B_ 1\)- and \(B_ 2\)-orientable graphs in kernel theory ⋮ A characterization of normal fraternally orientable perfect graphs ⋮ Intersection graphs of proper subtrees of unicyclic graphs ⋮ 1-perfectly orientable \(K_4\)-minor-free and outerplanar graphs ⋮ Grad and classes with bounded expansion. I: Decompositions ⋮ Perfect graphs, kernels, and cores of cooperative games ⋮ Colouring edges with many colours in cycles ⋮ 1-perfectly orientable \(K_{4}\)-minor-free and outerplanar graphs ⋮ \(1\)-perfectly orientable graphs and graph products ⋮ Avoidable vertices and edges in graphs: existence, characterization, and applications ⋮ Fraternal augmentations, arrangeability and linear Ramsey numbers ⋮ Generalization of transitive fraternal augmentations for directed graphs and its applications ⋮ Partial Characterizations of 1‐Perfectly Orientable Graphs
Cites Work
- Intersection graphs of paths in a tree
- Normal fraternally orientable graphs satisfy the strong perfect graph conjecture
- \(B_ 1\)- and \(B_ 2\)-orientable graphs in kernel theory
- Triangulated graphs and the elimination process
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs
This page was built for publication: An algorithm for fraternal orientation of graphs
