Fixed-edge theorem for graphs with loops
From MaRDI portal
Cited in
(58)- IFS on a metric space with a graph structure and extensions of the Kelisky-Rivlin theorem
- An application of the Helly property to the partially ordered sets
- On the Helly property working as a compactness criterion on graphs
- A retraction problem in graph theory
- Holes in ordered sets
- De Morgan algebras are universal
- A fixed cube theorem for median graphs
- On a pursuit game played on graphs for which a minor is excluded
- On multiplicative graphs and the product conjecture
- Invariant Hamming graphs in infinite quasi-median graphs
- List homomorphisms to reflexive graphs
- Spanning retracts of a partially ordered set
- A structure theory for ordered sets
- The fixed point property for small sets
- Algorithms for the fixed point property
- Finite invariant simplices in infinite graphs
- Dismantlable graphs and posets, fixed clique property
- A homology theory for colored graphs
- On the natural imprint function of a graph
- A retract characterization of posets with the fixed-point property
- A fixed box theorem for the cartesian product of graphs and metric spaces
- Jump-number of means on graphs
- Absolute retracts of bipartite graphs
- Obituary: Ivan Rival
- The smallest graph variety containing all paths
- On a class of isometric subgraphs of a graph
- Core-like properties of infinite graphs and structures
- Fixed finite subgraph theorems in infinite weakly modular graphs
- Stable graphs for a family of endomorphisms
- Homomorphically full graphs
- Graphs with a regular endomorphism monoid
- Metric fixed point theory on hyperconvex spaces: recent progress
- The fixed point property for ordered sets
- A Brouwer fixed-point theorem for graph endomorphisms
- On geodesic structures of weakly median graphs. II: Compactness, the role of isometric rays
- A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results
- Local properties of simplicial complexes
- More on linear and metric tree maps
- Retracting Graphs to Cycles
- Computational Complexity of Graph Partition under Vertex-Compaction to an Irreflexive Hexagon
- A dynamic location problem for graphs
- Products of absolute retracts
- Computational complexity relationship between compaction, vertex-compaction, and retraction
- Computational complexity of compaction to irreflexive cycles
- Fixed simplex property for retractable complexes
- Weak geodesic topology and fixed finite subgraph theorems in infinite partial cubes. I: Topologies and the geodesic convexity
- Weak geodesic topology and fixed finite subgraph theorems in infinite partial cubes. II: Fixed subgraph properties and infinite treelike partial cubes
- Approximate fixed points in metric spaces
- The complexity of the fixed clique property
- Backward edge-preserving maps between graphs
- The core of a graph
- An extension of a fixed point problem for simple graphs
- Graphical version of Brouwer's fixed point theorems over metric space
- Fixed point theorems in \(\mathbb R\)-trees with applications to graph theory
- Mobility of vertex-transitive graphs
- Retract rigid Cartesian products of graphs
- Cost thresholds for dynamic resource location
- Absolute retracts and varieties generated by chordal graphs
This page was built for publication: Fixed-edge theorem for graphs with loops
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3869378)
