On retracts, absolute retracts, and foldings in cographs
type: Item
instance of: scholarly article
title: On retracts, absolute retracts, and foldings in cographs
zbMATH Open document ID: 1393.05187
author: Ton Kloks
author: Yue-Li Wang
published in: Optimization Letters
publication date: 2018-05-28T00:00:00Z
Mathematics Subject Classification ID: 05C60
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6875325
zbMATH Keywords: retracts
zbMATH Keywords: absolute retracts
zbMATH Keywords: foldings
zbMATH Keywords: cographs
MaRDI profile type: Publication
full work available at URL: s11590-017-1126-9
OpenAlex ID: W163950404
cites work: Retracts of hypercubes
cites work: Absolute retracts of bipartite graphs
cites work: Achromatic number is NP-complete for cographs and interval graphs
cites work: O(n2.5) time algorithms for the subgraph homeomorphism problem on trees
cites work: A Linear Recognition Algorithm for Cographs
cites work: Q3077955
cites work: Q4028103
cites work: Paths, Trees, and Flowers
cites work: List homomorphisms and circular arc graphs
cites work: Exact algorithms for graph homomorphisms
cites work: Finding vertex-surjective graph homomorphisms
cites work: Trivially perfect graphs
cites work: Perfect Elimination and Chordal Bipartite Graphs
cites work: The complexity of homomorphism and constraint satisfaction problems seen from the other side
cites work: A Note on "The Comparability Graph of a Tree"
cites work: Q4352272
cites work: The achromatic number of a graph
cites work: The core of a graph
cites work: Q4828516
cites work: A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
cites work: Ordered and Unordered Tree Inclusion
cites work: Parameterized graph cleaning problems
cites work: Cleaning interval graphs
cites work: A lower estimate for the achromatic number of irreducible graphs
cites work: On the complexity of finding iso- and other morphisms for partial \(k\)- trees
cites work: A characterization of absolute retracts of n-chromatic graphs
cites work: Approximate labelled subtree homeomorphism
cites work: An Analysis of a Good Algorithm for the Subtree Problem
cites work: Faster Subtree Isomorphism
cites work: A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results
DOI: 10.1007/S11590-017-1126-9
description: scientific article; zbMATH DE number 6875325