The Comparability Graph of a Tree
From MaRDI portal
Publication:3845886
Cites work
Cited in
(58)- A New Characterization of P 6-Free Graphs
- Characterizations for co-graphs defined by restricted NLC-width or clique-width operations
- Graphs with all holes the same length
- Infinite versus finite graph domination
- Structural domination and coloring of some \(( P_7 , C_7)\)-free graphs
- Graphs with induced-saturation number zero
- Mortality of iterated Gallai graphs
- Two topics in tree inference: locating a phonological network effect in immediate recall and arborescence partitive set form
- Linear optimization over homogeneous matrix cones
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration
- Intersection problem for Droms RAAGs
- Edge contractions in subclasses of chordal graphs
- Graph classes and forbidden patterns on three vertices
- Complement reducible graphs
- Integer Laplacian eigenvalues of chordal graphs
- Rankings of graphs
- A note on perfect orders
- Graphs and partial orderings
- The chromatic symmetric functions of trivially perfect graphs and cographs
- Enumerating threshold graphs and some related graph classes
- Recognizing cographs and threshold graphs through a classification of their edges
- Characterizations of graphs having orientations satisfying local degree restrictions
- Color-bounded hypergraphs. VI: Structural and functional jumps in complexity
- Complete description of forbidden subgraphs in the structural domination problem
- Probe Ptolemaic Graphs
- Reconstructibility and perfect graphs
- Dominating cliques in \(P_ 5\)-free graphs
- On Decompositions of Partially Ordered Sets
- On algorithms for (P₅, gem)-free 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
- Homomorphically full graphs
- Dominating subgraphs in graphs with some forbidden structures
- A new characterization of trivially perfect graphs
- (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization.
- Computing square roots of trivially perfect and threshold graphs
- A note on chordal bound graphs and posets
- Probe threshold and probe trivially perfect graphs
- Equality perfect graphs and digraphs
- Satisfiability of \(\mathrm{ECTL}^*\) with local tree constraints
- Posets with interval upper bound graphs
- Quasi-threshold graphs
- The closeness eigenvalues of graphs
- A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements
- Containment orders – a lifelong journey
- Partially ordered sets and their comparability graphs
- On a class of posets and the corresponding comparability graphs
- Characterization of graphs with the limited normalized algebraic connectivity
- A characterization of moral transitive acyclic directed graph Markov models as labeled trees.
- More bounds for the Grundy number of graphs
- Online node- and edge-deletion problems with advice
- Hereditarily dominated graphs
- Diameter estimates for graph associahedra
- (Sub)linear kernels for edge modification problems toward structured graph classes
- Edge contractions in subclasses of chordal graphs
This page was built for publication: 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 Q3845886)
