Dacey Graphs

DOI10.1017/S1446788700029232MaRDI QIDQ4073400zbMATH OpenOpenAlexWikidataFDO

Authors David P. Sumner

Publication date 1974

Published in Journal of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s1446788700029232

Mathematics Subject Classification ID

Graph theory (05C99)

Cites work

• An Approach to Empirical Logic
• Operational Statistics. I. Basic Concepts
• Point determination in graphs
• Some Theorems on Abstract Graphs

Cited in

(41)

• A fast parallel algorithm to recognize P4-sparse graphs
• Characterizations for co-graphs defined by restricted NLC-width or clique-width operations
• Efficient parallel recognition of cographs
• The connected Ramsey number
• The edge nucleus of a point-determining graph
• On the spectrum of threshold graphs
• Coupon coloring of cographs
• \(k\)-NLC graphs and polynomial algorithms
• Geometry and Combinatorics via Right-Angled Artin Groups
• Some progress on the Aharoni-Korman conjecture
• Forbidden subgraphs of power graphs
• Complement reducible graphs
• The nucleus of a point determining graph
• Parallel algorithm for cograph recognition with applications
• The clique operator on cographs and serial graphs
• On characterizations for subclasses of directed co-graphs
• Unavoidable doubly connected large graphs
• Spectral properties of \(\mathcal{C}\)-graphs
• Distance-hereditary graphs
• An optimal path cover algorithm for cographs
• Cographs: eigenvalues and Dilworth number
• The signature of chordal graphs and cographs
• N-free posets and orthomodularity
• A tree representation for \(P_ 4\)-sparse graphs
• Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs
• Spectral properties of cographs and P₅-free graphs
• Efficient parallel recognition algorithms of cographs and distance hereditary graphs
• Reciprocal best match graphs
• On parallel recognition of cographs
• P₄-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
• From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats
• Parallel recognition of complement reducible graphs and cotree construction
• Constructible hypergraphs
• How to compute digraph width measures on directed co-graphs
• Distance eigenvalues of a cograph and their multiplicities
• A faster parallel connectivity algorithm on cographs
• Representing distance-hereditary graphs with multi-rooted trees
• Classification of non-solvable groups whose power graph is a cograph
• A linear-time recognition algorithm for \(P_{4}\)-reducible graphs
• Compact Distributed Interactive Proofs for the Recognition of Cographs and Distance-Hereditary Graphs
• Graphs defined on groups

This page was built for publication: Dacey Graphs

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