An algorithm for fraternal orientation of graphs (Q1197981): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Fanica Gavril / rank
Normal rank
 
Property / author
 
Property / author: Fanica Gavril / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(B_ 1\)- and \(B_ 2\)-orientable graphs in kernel theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal fraternally orientable graphs satisfy the strong perfect graph conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection graphs of paths in a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulated graphs and the elimination process / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:34, 16 May 2024

scientific article
Language Label Description Also known as
English
An algorithm for fraternal orientation of graphs
scientific article

    Statements