scientific article; zbMATH DE number 6472574

zbMath1321.05272MaRDI QIDQ5501778

Ross M. McConnell, Jeremy P. Spinrad

Publication date: 14 August 2015

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (24)

A note on transitive orientations with maximum sets of sources and sinks ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The complexity of embedding orders into small products of chains ⋮ Comparability graphs among cover-incomparability graphs ⋮ The Complexity of the Partial Order Dimension Problem: Closing the Gap ⋮ Dominance drawings for DAGs with bounded modular width ⋮ Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs ⋮ Drawing Order Diagrams Through Two-Dimension Extension ⋮ Easily Testable Graph Properties ⋮ Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem ⋮ On the \(P_4\)-components of graphs ⋮ Line-distortion, bandwidth and path-length of a graph ⋮ Dimension-2 poset competition numbers and dimension-2 poset double competition numbers ⋮ NP-completeness results for edge modification problems ⋮ Fully dynamic algorithm for recognition and modular decomposition of permutation graphs ⋮ Recognizing \(k\)-clique extendible orderings ⋮ Two minimal forbidden subgraphs for double competition graphs of posets of dimension at most two ⋮ Localized and compact data-structure for comparability graphs ⋮ Enumeration aspects of maximal cliques and bicliques ⋮ Unnamed Item ⋮ Construction of a simple elimination scheme for a chordal comparability graph in linear time ⋮ Even and odd pairs in comparability and in \(P_4\)-comparability graphs ⋮ Distance Labeling for Permutation Graphs

This page was built for publication: