On a class of posets and the corresponding comparability graphs

DOI10.1016/0095-8956(78)90013-8zbMath0382.05045WikidataQ29014056 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

06A06: Partial orders, general

05C05: Trees

05C99: Graph theory

Related Items

Computing the Scattering Number of Graphs, Relationships between scattering number and other vulnerability parameters, Vulnerability parameters of split graphs, Rupture degree of graphs, A linear-time recognition algorithm for \(P_{4}\)-reducible graphs, Parallel recognition of complement reducible graphs and cotree construction, Vertex vulnerability parameters of Kronecker products of complete graphs, Infinite versus finite graph domination, Approximating the maximum internal spanning tree problem, Distance-hereditary graphs, Scattering number and extremal non-Hamiltonian graphs, Hereditary modular graphs, Complement reducible graphs, A catalogue of small maximal nonhamiltonian graphs, A tree representation for \(P_ 4\)-sparse graphs, Scattering number and modular decomposition, 1-tough cocomparability graphs are hamiltonian, Measuring the vulnerability for classes of intersection graphs, A fast parallel algorithm to recognize P4-sparse graphs, Path partition for graphs with special blocks, Hamiltonicity in graphs with few \(P_ 4\)'s, Unavoidable doubly connected large graphs, The clique operator on cographs and serial graphs, Linear time optimization algorithms for \(P_ 4\)-sparse graphs, An optimal path cover algorithm for cographs, Homomorphically full graphs, Efficient parallel recognition of cographs, Relationships between rupture degree and other parameters, P₄-Reducible Graphs-Class of Uniquely Tree-Representable Graphs, The rupture degree of trees, COMPUTING THE RUPTURE DEGREE IN COMPOSITE GRAPHS, Unnamed Item

Cites Work

• Tough graphs and Hamiltonian circuits.
• The Comparability Graph of a Tree
• Hamiltonian circuits and path coverings of vertices in graphs
• A Note on "The Comparability Graph of a Tree"
• Zu einem Satz von E. S. Wolk über die Vergleichbarkeitsgraphen von ordnungsteoretischen Bäumen
• A Characterization of Comparability Graphs and of Interval Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item