Fixed-edge theorem for graphs with loops
From MaRDI portal
Publication:3869378
DOI10.1002/jgt.3190030404zbMath0432.05030OpenAlexW1544755278MaRDI QIDQ3869378
Ivan Rival, Richard J. Nowakowski
Publication date: 1979
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190030404
Related Items
Fixed point theorems in \(\mathbb R\)-trees with applications to graph theory, Fixed finite subgraph theorems in infinite weakly modular graphs, Dismantlable graphs and posets, fixed clique property, Holes in ordered sets, De Morgan algebras are universal, A homology theory for colored graphs, A fixed cube theorem for median graphs, On the natural imprint function of a graph, On a pursuit game played on graphs for which a minor is excluded, A retract characterization of posets with the fixed-point property, A fixed box theorem for the cartesian product of graphs and metric spaces, On multiplicative graphs and the product conjecture, Mobility of vertex-transitive graphs, Computational complexity of compaction to irreflexive cycles, Stable graphs for a family of endomorphisms, Homomorphically full graphs, Local properties of simplicial complexes, Invariant Hamming graphs in infinite quasi-median graphs, List homomorphisms to reflexive graphs, Graphs with a regular endomorphism monoid, Fixed simplex property for retractable complexes, Metric fixed point theory on hyperconvex spaces: recent progress, The fixed point property for ordered sets, Spanning retracts of a partially ordered set, A structure theory for ordered sets, Retract rigid Cartesian products of graphs, 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, Cost thresholds for dynamic resource location, The core of a graph, An extension of a fixed point problem for simple graphs, A Brouwer fixed-point theorem for graph endomorphisms, Products of absolute retracts, Absolute retracts and varieties generated by chordal graphs, On geodesic structures of weakly median graphs. II: Compactness, the role of isometric rays, Computational complexity relationship between compaction, vertex-compaction, and retraction, A dynamic location problem for graphs, The fixed point property for small sets, IFS on a metric space with a graph structure and extensions of the Kelisky-Rivlin theorem, Retracting Graphs to Cycles, Absolute retracts of bipartite graphs, Obituary: Ivan Rival, Algorithms for the fixed point property, Computational Complexity of Graph Partition under Vertex-Compaction to an Irreflexive Hexagon, The smallest graph variety containing all paths, On a class of isometric subgraphs of a graph, Jump-number of means on graphs, Core-like properties of infinite graphs and structures, More on linear and metric tree maps, An application of the Helly property to the partially ordered sets, A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results, On the Helly property working as a compactness criterion on graphs, Finite invariant simplices in infinite graphs, A retraction problem in graph theory
Cites Work
