On a class of posets and the corresponding comparability graphs

DOI10.1016/0095-8956(78)90013-8zbMath0382.05045DBLPjournals/jct/Jung78OpenAlexW2055745794WikidataQ29014056 ScholiaQ29014056MaRDI QIDQ1247984

Heinz A. Jung

Publication date: 1978

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(78)90013-8

Mathematics Subject Classification ID

Partial orders, general (06A06) Trees (05C05) Graph theory (05C99)

Related Items (99)

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

Cites Work

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