A Note on "The Comparability Graph of a Tree"

Cited in

(72)

Perfectness of normal products of graphs
scientific article; zbMATH DE number 3781195 (Why is no real title available?)
Bounded context switching for valence systems
A New Characterization of P 6-Free Graphs
On retracts, absolute retracts, and foldings in cographs
The code problem for traces -- improving the boundaries
Right-angled Artin groups and enhanced Koszul properties
Hereditary equality of domination and exponential domination
Mortality of iterated Gallai graphs
A class of threshold and domishold graphs: Equistable and equidominating graphs
Linear optimization over homogeneous matrix cones
Edge contractions in subclasses of chordal graphs
Some new results on generalized additive games
Game-perfect graphs
Fast quasi-threshold editing
New results on connected dominating structures in graphs
Complement reducible graphs
Knapsack in graph groups
On the poset of all posets on n elements
The chromatic symmetric functions of trivially perfect graphs and cographs
Color-bounded hypergraphs. VI: Structural and functional jumps in complexity
Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs
Trivially perfect graphs
On graphs whose second largest eigenvalue does not exceed \((\sqrt {5}-1)/2\)
Probe Ptolemaic Graphs
scientific article; zbMATH DE number 2230209 (Why is no real title available?)
Laplacian graph eigenvectors
Characterizations of the decidability of some problems for regular trace languages
On algorithms for (P₅, gem)-free graphs
Dominating cliques in graphs
Monotonic stable solutions for minimum coloring games
A new characterization of \(P_{6}\)-free graphs
Satisfiability of \(\mathsf {ECTL}^*\) with tree constraints
On trees and tree dimension of ordered sets
Computing optimal leaf roots of chordal cographs in linear time
Multidimensional scaling and threshold graphs
Homomorphically full graphs
Stack sortable permutations
The dimension of planar posets
Comparability graphs and a new matroid
A new characterization of trivially perfect graphs
Treelike comparability graphs
The emptiness problem for valence automata over graph monoids
Computing square roots of trivially perfect and threshold graphs
A note on chordal bound graphs and posets
Probe threshold and probe trivially perfect graphs
Satisfiability of \(\mathrm{ECTL}^*\) with local tree constraints
Posets with interval upper bound graphs
Quasi-threshold graphs
The closeness eigenvalues of graphs
The submonoid and rational subset membership problems for graph groups.
Systems of representatives
Enumerative aspects of certain subclasses of perfect graphs
A note on a paper by D. Seinsche
Containment orders – a lifelong journey
Induced saturation of graphs
On a class of posets and the corresponding comparability graphs
Dominating cliques in graphs
A structural approach for independent domination of regular graphs
Planar graphs whose second largest eigenvalue smaller than \(\frac{\sqrt{5}-1}{2}\)
Efficient rewriting in cograph trace monoids
A characterization of moral transitive acyclic directed graph Markov models as labeled trees.
Dominating sets in social network graphs
Domination on hyperbolic graphs
Graphs with second largest eigenvalue less than 1/2
Laplacian spectrum of weakly quasi-threshold graphs
The strongly perfectness of normal product of \(t\)-perfect graphs
Neighborhood perfect graphs
On randomized stopping points and perfect graphs
On the properties of weighted minimum colouring games
Edge contractions in subclasses of chordal graphs
On some decision problems for trace codings

This page was built for publication: A Note on "The Comparability Graph of a Tree"

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5510193)