On the public citation graph

Absolute retracts in graphs

https://doi.org/10.1007/bfb0066450
0 signed · 70 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4684-2001-2openalex-snapshot
Complexity of Computer Computations
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/bf01210984openalex-snapshot
Graph derivatives
inferredcites →https://doi.org/10.1007/bf02945020openalex-snapshot
Full embeddings into some categories of graphs
inferredcites →https://doi.org/10.1016/0095-8956(74)90040-9openalex-snapshot
Absolute planar retracts and the four color conjecture
inferredcites →https://doi.org/10.1090/s0002-9939-1972-0291032-8openalex-snapshot
Nonconstant Endomorphisms of Lattices
inferredcites →https://doi.org/10.21236/ad0705364openalex-snapshot
GRAPH THEORY
inferredcites →https://doi.org/10.4064/fm-17-1-152-170openalex-snapshot
Sur les rétractes
inferredcites →https://doi.org/10.4153/cjm-1966-121-7openalex-snapshot
On Rigid Undirected Graphs
inferredcites →https://doi.org/10.4153/cjm-1968-151-xopenalex-snapshot
The Categorical Product of Graphs
inferredcites →https://doi.org/10.4153/cjm-1973-024-8openalex-snapshot
Groups and Monoids of Regular Graphs (And of Graphs with Bounded Degrees)
inferredcites →https://doi.org/10.6028/jres.069b.004openalex-snapshot
Minimum partition of a matroid into independent subsets

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/jgt.3190080407openalex-snapshot
Retracts of hypercubes
inferred← citeshttps://doi.org/10.1002/jgt.3190110316openalex-snapshot
Unretractive and S‐unretractive joins and lexicographic products of graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190110416openalex-snapshot
Minimal extensions of graphs to absolute retracts
inferred← citeshttps://doi.org/10.1002/jgt.3190150503openalex-snapshot
Multiplicativity. Part I. Variations, multiplicative graphs, and digraphs
inferred← citeshttps://doi.org/10.1006/eujc.2001.0555openalex-snapshot
On the Natural Imprint Function of a Graph
inferred← citeshttps://doi.org/10.1006/jctb.1997.1746openalex-snapshot
Retracts of Infinite Hamming Graphs
inferred← citeshttps://doi.org/10.1007/3-540-33700-8_20openalex-snapshot
From Graph Colouring to Constraint Satisfaction: There and Back Again
inferred← citeshttps://doi.org/10.1007/3-540-36379-3_35openalex-snapshot
Connected and Loosely Connected List Homomorphisms
inferred← citeshttps://doi.org/10.1007/978-1-4613-0163-9_6openalex-snapshot
Homomorphisms
inferred← citeshttps://doi.org/10.1007/978-3-030-86838-3_25openalex-snapshot
Beyond Helly Graphs: The Diameter Problem on Absolute Retracts
inferred← citeshttps://doi.org/10.1007/978-3-319-01586-6_6openalex-snapshot
Fixed Point Theory in Ordered Sets from the Metric Point of View
inferred← citeshttps://doi.org/10.1007/978-3-540-27798-9_41openalex-snapshot
Computational Complexity Classification of Partition under Compaction and Retraction
inferred← citeshttps://doi.org/10.1007/978-94-015-8937-6_4openalex-snapshot
Graph homomorphisms: structure and symmetry
inferred← citeshttps://doi.org/10.1007/bf01189142openalex-snapshot
Endomorphisms of graphs II. Various unretractive graphs
inferred← citeshttps://doi.org/10.1007/bf02122553openalex-snapshot
On multiplicative graphs and the product conjecture
inferred← citeshttps://doi.org/10.1007/bf02122796openalex-snapshot
Hereditary modular graphs
inferred← citeshttps://doi.org/10.1007/bf02124674openalex-snapshot
A Dynamic location problem for graphs
inferred← citeshttps://doi.org/10.1007/bf02579284openalex-snapshot
On a class of isometric subgraphs of a graph
inferred← citeshttps://doi.org/10.1007/s004939970003openalex-snapshot
List Homomorphisms and Circular Arc Graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(83)90159-0openalex-snapshot
The smallest graph variety containing all paths
inferred← citeshttps://doi.org/10.1016/0012-365x(85)90062-7openalex-snapshot
A retraction problem in graph theory
inferred← citeshttps://doi.org/10.1016/0012-365x(85)90159-1openalex-snapshot
A characterization of absolute retracts of n-chromatic graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(86)90212-8openalex-snapshot
Pseudo-modular graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(88)90016-7openalex-snapshot
Products of absolute retracts
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90054-jopenalex-snapshot
The retracts of Hamming graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90282-kopenalex-snapshot
The core of a graph
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90285-nopenalex-snapshot
Retracts of strong products of graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90181-ropenalex-snapshot
Une extension du problème du point fixe pour des graphes simples
inferred← citeshttps://doi.org/10.1016/0012-365x(93)e0062-9openalex-snapshot
Absolute retracts of split graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(91)90051-kopenalex-snapshot
Efficient characterizations of n-chromatic absolute retracts
inferred← citeshttps://doi.org/10.1016/0097-3165(85)90061-5openalex-snapshot
On the helly property working as a compactness criterion on graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(87)90058-8openalex-snapshot
Absolute retracts of bipartite graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90219-eopenalex-snapshot
Absolute reflexive retracts and absolute bipartite retracts
inferred← citeshttps://doi.org/10.1016/b978-0-12-386870-1.50026-5openalex-snapshot
Dynamic Search in Graphs
inferred← citeshttps://doi.org/10.1016/j.cosrev.2008.10.003openalex-snapshot
Colouring, constraint satisfaction, and complexity
inferred← citeshttps://doi.org/10.1016/j.disc.2004.02.023openalex-snapshot
On median nature and enumerative properties of Fibonacci-like cubes
inferred← citeshttps://doi.org/10.1016/j.disc.2006.04.009openalex-snapshot
On the extension of vertex maps to graph homomorphisms
inferred← citeshttps://doi.org/10.1016/j.disc.2009.08.013openalex-snapshot
Absolute retracts and varieties generated by chordal graphs
inferred← citeshttps://doi.org/10.1016/j.jcss.2004.07.003openalex-snapshot
A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results
inferred← citeshttps://doi.org/10.1016/s0022-0000(03)00034-5openalex-snapshot
Computational complexity of compaction to irreflexive cycles
inferred← citeshttps://doi.org/10.1093/oso/9780198708704.001.0001openalex-snapshot
Graphs and Homomorphisms
inferred← citeshttps://doi.org/10.1093/oso/9780198708704.002.0004openalex-snapshot
Copyright page
inferred← citeshttps://doi.org/10.1093/oso/9780198708704.002.0005openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1093/oso/9780198708704.003.0001openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1093/oso/9780198708704.003.0002openalex-snapshot
Products, retracts, and polymorphisms
inferred← citeshttps://doi.org/10.1093/oso/9780198708704.003.0003openalex-snapshot
The partial order of graphs and homomorphisms
inferred← citeshttps://doi.org/10.1093/oso/9780198708704.003.0004openalex-snapshot
The structure of composition
inferred← citeshttps://doi.org/10.1093/oso/9780198708704.003.0005openalex-snapshot
Testing for the existence of homomorphisms
inferred← citeshttps://doi.org/10.1093/oso/9780198708704.003.0006openalex-snapshot
Colouring—variations on a theme
inferred← citeshttps://doi.org/10.1093/oso/9780198708704.003.0007openalex-snapshot
Recent highlights
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1979.tb17773.xopenalex-snapshot
AN INTRODUCTION TO THE CATEGORY OF GRAPHS*
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1979.tb32801.xopenalex-snapshot
GRAPHS WITH FORBIDDEN HOMOMORPHIC IMAGES
inferred← citeshttps://doi.org/10.1137/0405017openalex-snapshot
On the Nonmultiplicativity of Oriented Cycles
inferred← citeshttps://doi.org/10.1137/120894312openalex-snapshot
Graphs Admitting $k$-NU Operations. Part 1: The Reflexive Case
inferred← citeshttps://doi.org/10.1145/3397472openalex-snapshot
The Complexity of Approximately Counting Retractions
inferred← citeshttps://doi.org/10.1145/3458040openalex-snapshot
The Complexity of Approximately Counting Retractions to Square-free Graphs
inferred← citeshttps://doi.org/10.4153/cjm-1987-025-1openalex-snapshot
Absolute Retracts and Varieties of Reflexive Graphs
inferred← citeshttps://doi.org/10.5817/cz.muni.eurocomb23-055openalex-snapshot
Precoloring extension in planar near-Eulerian-triangulations
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.