A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs
From MaRDI portal
Publication:3958485
DOI10.1002/jgt.3190060307zbMath0495.05027OpenAlexW2084631735MaRDI QIDQ3958485
Publication date: 1982
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190060307
Structural characterization of families of graphs (05C75) Graph theory (05C99) Directed graphs (digraphs), tournaments (05C20)
Related Items
Oriented expressions of graph properties, \(B_ 1\)- and \(B_ 2\)-orientable graphs in kernel theory, A classification of locally semicomplete digraphs, A characterization of normal fraternally orientable perfect graphs, Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments, Solving the canonical representation and star system problems for proper circular-arc graphs in logspace, On powers of circular arc graphs and proper circular arc 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, Normal Helly circular-arc graphs and its subclasses, Colouring edges with many colours in cycles, Structural results on circular-arc graphs and circle graphs: a survey and the main open problems, Chromatic quasisymmetric functions of directed graphs, 1-perfectly orientable \(K_{4}\)-minor-free and outerplanar graphs, Circular-arc hypergraphs: rigidity via connectedness, An algorithm for fraternal orientation of graphs, On the structure of locally semicomplete digraphs, \(1\)-perfectly orientable graphs and graph products, Fast algorithms for finding Hamiltonian paths and cycles in in-tournament digraphs, Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs, Unnamed Item, Kernels in quasi-transitive digraphs, Duality pairs and homomorphisms to oriented and unoriented cycles, Avoidable vertices and edges in graphs: existence, characterization, and applications, Circularly Compatible Ones, $D$-Circularity, and Proper Circular-Arc Bigraphs, Fraternal augmentations, arrangeability and linear Ramsey numbers, Generalization of transitive fraternal augmentations for directed graphs and its applications, Characterizations and recognition of circular-arc graphs and subclasses: a survey, Linkages in locally semicomplete digraphs and quasi-transitive digraphs, Lexicographic Orientation Algorithms, Graph Classes and Forbidden Patterns on Three Vertices, Obstructions for acyclic local tournament orientation completions, Interval graphs and related topics, Normal fraternally orientable graphs satisfy the strong perfect graph conjecture, On chordal proper circular arc graphs, Partial Characterizations of 1‐Perfectly Orientable Graphs
Cites Work
