The following pages link to The Comparability Graph of a Tree (Q3845886):
Displaying 50 items.
- Graphs with induced-saturation number zero (Q276201) (← links)
- Two topics in tree inference: locating a phonological network effect in immediate recall and arborescence partitive set form (Q285951) (← links)
- Recognizing cographs and threshold graphs through a classification of their edges (Q294753) (← links)
- Color-bounded hypergraphs. VI: Structural and functional jumps in complexity (Q383764) (← links)
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration (Q387008) (← links)
- Edge contractions in subclasses of chordal graphs (Q423902) (← links)
- Approximate association via dissociation (Q505447) (← links)
- More bounds for the Grundy number of graphs (Q511707) (← links)
- Reconstructibility and perfect graphs (Q595687) (← links)
- On algorithms for (\(P_5\), gem)-free graphs (Q817767) (← links)
- Characterizations for co-graphs defined by restricted NLC-width or clique-width operations (Q819817) (← links)
- Hereditarily dominated graphs (Q868368) (← links)
- A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements (Q963386) (← links)
- Infinite versus finite graph domination (Q968422) (← links)
- A new characterization of \(P_{6}\)-free graphs (Q972332) (← links)
- Complete description of forbidden subgraphs in the structural domination problem (Q1025505) (← links)
- Probe threshold and probe trivially perfect graphs (Q1034600) (← links)
- Posets with interval upper bound graphs (Q1104348) (← links)
- A note on perfect orders (Q1124614) (← links)
- Complement reducible graphs (Q1153105) (← links)
- Dominating cliques in \(P_ 5\)-free graphs (Q1176051) (← links)
- On a class of posets and the corresponding comparability graphs (Q1247984) (← links)
- On trees and tree dimension of ordered sets (Q1318361) (← links)
- Mortality of iterated Gallai graphs (Q1321643) (← links)
- Dominating subgraphs in graphs with some forbidden structures (Q1343259) (← links)
- A characterization of moral transitive acyclic directed graph Markov models as labeled trees. (Q1395885) (← links)
- (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization. (Q1428548) (← links)
- The chromatic symmetric functions of trivially perfect graphs and cographs (Q1756046) (← links)
- Homomorphically full graphs (Q1917297) (← links)
- Quasi-threshold graphs (Q1923584) (← links)
- Online node- and edge-deletion problems with advice (Q1979452) (← links)
- Diameter estimates for graph associahedra (Q2093260) (← links)
- (Sub)linear kernels for edge modification problems toward structured graph classes (Q2093576) (← links)
- Structural domination and coloring of some \(( P_7 , C_7)\)-free graphs (Q2222949) (← links)
- Integer Laplacian eigenvalues of chordal graphs (Q2229473) (← links)
- Monotonic stable solutions for minimum coloring games (Q2248763) (← links)
- Satisfiability of \(\mathrm{ECTL}^*\) with local tree constraints (Q2411048) (← links)
- Computing square roots of trivially perfect and threshold graphs (Q2446337) (← links)
- A note on chordal bound graphs and posets (Q2470467) (← links)
- Graphs and partial orderings (Q2535845) (← links)
- Partially ordered sets and their comparability graphs (Q2545312) (← links)
- Edge Contractions in Subclasses of Chordal Graphs (Q3010431) (← links)
- Satisfiability of ECTL* with Tree Constraints (Q3194710) (← links)
- (Q3303537) (← links)
- A New Characterization of P 6-Free Graphs (Q3511353) (← links)
- Probe Ptolemaic Graphs (Q3511358) (← links)
- Characterizations of graphs having orientations satisfying local degree restrictions (Q4154884) (← links)
- Intersection problem for Droms RAAGs (Q4554881) (← links)
- A new characterization of trivially perfect graphs (Q5006549) (← links)
- Enumerating threshold graphs and some related graph classes (Q5080334) (← links)
