A Note on "The Comparability Graph of a Tree"
From MaRDI portal
Publication:5510193
DOI10.2307/2033992zbMath0137.18105OpenAlexW4240903705MaRDI QIDQ5510193
Publication date: 1965
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2033992
Related Items
On the poset of all posets on \(n\) elements, Some new results on generalized additive games, Neighborhood perfect graphs, On randomized stopping points and perfect graphs, Fast Quasi-Threshold Editing, Efficient rewriting in cograph trace monoids, Posets with interval upper bound graphs, Multidimensional scaling and threshold graphs, Dominating sets in social network graphs, Satisfiability of ECTL* with Tree Constraints, Homomorphically full graphs, The strongly perfectness of normal product of \(t\)-perfect graphs, The emptiness problem for valence automata over graph monoids, Quasi-threshold graphs, Satisfiability of \(\mathrm{ECTL}^*\) with local tree constraints, Color-bounded hypergraphs. VI: Structural and functional jumps in complexity, The code problem for traces -- improving the boundaries, Linear optimization over homogeneous matrix cones, A characterization of moral transitive acyclic directed graph Markov models as labeled trees., The closeness eigenvalues of graphs, Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs, Hereditary equality of domination and exponential domination, A New Characterization of P 6-Free Graphs, Probe Ptolemaic Graphs, Domination on hyperbolic graphs, Edge contractions in subclasses of chordal graphs, Complement reducible graphs, Knapsack in graph groups, Graphs with second largest eigenvalue less than 1/2, Computing square roots of trivially perfect and threshold graphs, Unnamed Item, Right-angled Artin groups and enhanced Koszul properties, Stack sortable permutations, Induced saturation of graphs, Dominating cliques in graphs, A structural approach for independent domination of regular graphs, On some decision problems for trace codings, Bounded Context Switching for Valence Systems, The submonoid and rational subset membership problems for graph groups., Edge Contractions in Subclasses of Chordal Graphs, A note on chordal bound graphs and posets, On retracts, absolute retracts, and foldings in cographs, Monotonic stable solutions for minimum coloring games, The chromatic symmetric functions of trivially perfect graphs and cographs, Unnamed Item, A note on a paper by D. Seinsche, Dominating cliques in graphs, A new characterization of \(P_{6}\)-free graphs, The dimension of planar posets, Comparability graphs and a new matroid, New results on connected dominating structures in graphs, On a class of posets and the corresponding comparability graphs, Trivially perfect graphs, Perfectness of normal products of graphs, Game-perfect graphs, Laplacian spectrum of weakly quasi-threshold graphs, Systems of representatives, Treelike comparability graphs, Unnamed Item, Probe threshold and probe trivially perfect graphs, Characterizations of the decidability of some problems for regular trace languages, On graphs whose second largest eigenvalue does not exceed \((\sqrt {5}-1)/2\), Enumerative aspects of certain subclasses of perfect graphs, A new characterization of trivially perfect graphs, A class of threshold and domishold graphs: Equistable and equidominating graphs, On the properties of weighted minimum colouring games, Laplacian graph eigenvectors, On trees and tree dimension of ordered sets, Mortality of iterated Gallai graphs, On algorithms for (\(P_5\), gem)-free graphs
