Dacey Graphs
From MaRDI portal
Publication:4073400
DOI10.1017/S1446788700029232zbMath0314.05108OpenAlexW4254852668WikidataQ56475008 ScholiaQ56475008MaRDI QIDQ4073400
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
Related Items (36)
Characterizations for co-graphs defined by restricted NLC-width or clique-width operations ⋮ Distance-hereditary graphs ⋮ \(k\)-NLC graphs and polynomial algorithms ⋮ A faster parallel connectivity algorithm on cographs ⋮ Efficient parallel recognition algorithms of cographs and distance hereditary graphs ⋮ Geometry and Combinatorics via Right-Angled Artin Groups ⋮ Parallel algorithm for cograph recognition with applications ⋮ An optimal path cover algorithm for cographs ⋮ The signature of chordal graphs and cographs ⋮ P4-Reducible Graphs-Class of Uniquely Tree-Representable Graphs ⋮ From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats ⋮ A fast parallel algorithm to recognize P4-sparse graphs ⋮ On the spectrum of threshold graphs ⋮ Classification of non-solvable groups whose power graph is a cograph ⋮ On parallel recognition of cographs ⋮ Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs ⋮ Complement reducible graphs ⋮ Parallel recognition of complement reducible graphs and cotree construction ⋮ How to compute digraph width measures on directed co-graphs ⋮ Distance eigenvalues of a cograph and their multiplicities ⋮ Constructible hypergraphs ⋮ A tree representation for \(P_ 4\)-sparse graphs ⋮ Coupon coloring of cographs ⋮ A linear-time recognition algorithm for \(P_{4}\)-reducible graphs ⋮ Graphs defined on groups ⋮ The nucleus of a point determining graph ⋮ On characterizations for subclasses of directed co-graphs ⋮ The connected Ramsey number ⋮ The edge nucleus of a point-determining graph ⋮ Forbidden subgraphs of power graphs ⋮ Reciprocal best match graphs ⋮ Spectral properties of cographs andP5-free graphs ⋮ Cographs: eigenvalues and Dilworth number ⋮ Unavoidable doubly connected large graphs ⋮ The clique operator on cographs and serial graphs ⋮ Efficient parallel recognition of cographs
Cites Work
This page was built for publication: Dacey Graphs
