On a class of posets and the corresponding comparability graphs

DOI10.1016/0095-8956(78)90013-8zbMATH Open0382.05045DBLPjournals/jct/Jung78OpenAlexW2055745794WikidataQ29014056 ScholiaQ29014056MaRDI QIDQ1247984FDOQ1247984

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
The Comparability Graph of a Tree
A Characterization of Comparability Graphs and of Interval Graphs
Tough graphs and Hamiltonian circuits.
A Note on "The Comparability Graph of a Tree"
Hamiltonian circuits and path coverings of vertices in graphs
Zu einem Satz von E. S. Wolk über die Vergleichbarkeitsgraphen von ordnungsteoretischen Bäumen

Cited In (only showing first 100 items - show all)

A fast parallel algorithm to recognize P4-sparse graphs
Efficient parallel recognition of cographs
Spectral properties of cographs andP₅-free graphs
On the spectrum of threshold graphs
Generalizing cographs to 2-cographs
Scattering number and extremal non-Hamiltonian graphs
Extreme tenacity of graphs with given order and size
Infinite versus finite graph domination
Geometry and Combinatorics via Right-Angled Artin Groups
Miscellaneous Digraph Classes
Complement reducible graphs
A polynomial algorithm for computing the weak rupture degree of trees
Parallel algorithm for cograph recognition with applications
Tree robustness of a graph
Vulnerability parameters of split graphs
The clique operator on cographs and serial graphs
Hamiltonian properties of polyhedra with few 3-cuts. A survey
Relationships between scattering number and other vulnerability parameters
1-tough cocomparability graphs are hamiltonian
Cographs which are cover-incomparability graphs of posets
Unavoidable doubly connected large graphs
Vertex vulnerability parameters of Kronecker products of complete graphs
Distance-hereditary graphs
Path partition for graphs with special blocks
The signature of chordal graphs and cographs
Cographs: eigenvalues and Dilworth number
An optimal path cover algorithm for cographs
The average scattering number of graphs
Robustness of regular ring lattices based on natural connectivity
Approximating the maximum internal spanning tree problem
Hamiltonian-connectedness of triangulations with few separating triangles
On operations preserving semi-transitive orientability of graphs
A tree representation for \(P_ 4\)-sparse graphs
Homomorphically full graphs
Toughness, forbidden subgraphs and pancyclicity
Toughness, forbidden subgraphs, and Hamilton-connected graphs
Title not available (Why is that?)
Measuring the vulnerability for classes of intersection graphs
Tree-core and tree-coritivity of graphs
Lower bounds for the Estrada index using mixing time and Laplacian spectrum
Assistance and interdiction problems on interval graphs
Forbidden subgraphs for Hamiltonicity of 1-tough graphs
RESIDUAL CLOSENESS AND GENERALIZED CLOSENESS
P₄-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
Hamiltonicity in graphs with few \(P_ 4\)'s
Tenacity of total graphs
Parallel recognition of complement reducible graphs and cotree construction
Toughness and prism-Hamiltonicity of \(P_4\)-free graphs
How to compute digraph width measures on directed co-graphs
Distance eigenvalues of a cograph and their multiplicities
2-edge-Hamiltonian-connectedness of 4-connected plane graphs
Hereditary modular graphs
Computing the Scattering Number of Graphs
Scattering number and modular decomposition
Generalized Fitch graphs. II: Sets of binary relations that are explained by edge-labeled trees
Rupture degree of graphs
Compact Distributed Interactive Proofs for the Recognition of Cographs and Distance-Hereditary Graphs
A linear-time recognition algorithm for \(P_{4}\)-reducible graphs
Implementation of RTO in a large hydrogen network considering uncertainty
Linear time optimization algorithms for \(P_ 4\)-sparse graphs
Graphs defined on groups
Robustness of random graphs based on graph spectra
A catalogue of small maximal nonhamiltonian graphs
Linear‐Time Algorithms for Scattering Number and Hamilton‐Connectivity of Interval Graphs
Link Vulnerability in Networks
Algorithms for maximum internal spanning tree problem for some graph classes
Cyclability in graph classes
Node and link vulnerability in complete multipartite networks
A Note on the Link Residual Closeness of Graphs Under Join Operation
Network robustness and residual closeness
Computing the weighted isolated scattering number of interval graphs in polynomial time
Graph vulnerability parameters, compression, and threshold graphs
Robustness of Regular Caterpillars
The Smallest Classes of Binary and Ternary Matroids Closed under Direct Sums and Complements
Bounds for scattering number and rupture degree of graphs with genus
Some progress on the Aharoni-Korman conjecture
Seidel matrices, Dilworth number and an eigenvalue-free interval for cographs
Computing the weighted neighbor isolated tenacity of interval graphs in polynomial time
Characterizing and computing weight-equitable partitions of graphs
On the residual closeness of graphs with cut vertices
Isolated Rupture in Thorny Networks
Neighbor Isolated Tenacity of Graphs
The scattering number of strictly chordal graphs: linear time determination
Some conditions for Hamiltonian cycles in 1-tough \((K_2 \cup kK_1)\)-free graphs
Cographs and 1-sums
A polynomial algorithm for weighted scattering number in interval graphs
Neighbor Rupture Degree of Harary Graphs
The rupture degree of trees
A unified combinatorial view beyond some spectral properties
Binding Number and Wheel Related Graphs
Computational complexity of network vulnerability analysis
RESIDUAL CLOSENESS OF WHEELS AND RELATED NETWORKS
Two completely independent spanning trees of \(P_4\)-free graphs
Large matchings in maximal 1-planar graphs
Relationships between rupture degree and other parameters
Semi-proper interval graphs
Disjoint path covers joining prescribed source and sink sets in interval graphs
Isolated Rupture in Composite Networks
COMPUTING THE RUPTURE DEGREE IN COMPOSITE GRAPHS
A Comparison Between Edge Neighbor Rupture Degree and Edge Scattering Number in Graphs

This page was built for publication: On a class of posets and the corresponding comparability graphs

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