The smallest graph variety containing all paths

DOI10.1016/0012-365X(83)90159-0zbMATH Open0511.05059OpenAlexW2075618163MaRDI QIDQ1838985FDOQ1838985

Authors: R. J. Nowakowski, Ivan Rival 

Publication date: 1983

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(83)90159-0

zbMATH Keywords

reflexive graphstrong productretractisometric subgraphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph theory (05C99)

Cites Work

• Vertex-to-vertex pursuit in a graph
• Fixed-edge theorem for graphs with loops
• Absolute planar retracts and the four colour conjecture
• Title not available (Why is that?)
• On a class of isometric subgraphs of a graph
• Title not available (Why is that?)
• A structure theory for ordered sets

Cited In (35)

• A note on \(r\)-dominating cliques
• Title not available (Why is that?)
• On the natural imprint function of a graph
• Retract rigid Cartesian products of graphs
• Injective hulls of various graph classes
• The Helly property and satisfiability of Boolean formulas defined on set families
• Absolute retracts and varieties generated by chordal graphs
• Pseudo-modular graphs
• A game of cops and robbers
• Graph algebras and graph varieties
• A dynamic location problem for graphs
• Injective envelopes of transition systems and Ferrers languages
• Vertex-to-vertex pursuit in a graph
• Graphs of some CAT(0) complexes
• Clique graphs and Helly graphs
• The retracts of Hamming graphs
• Building blocks for the variety of absolute retracts
• A Radon theorem for Helly graphs
• Products of absolute retracts
• Retracts of strong products of graphs
• Helly-gap of a graph and vertex eccentricities
• On the extension of vertex maps to graph homomorphisms
• Strong Retracts of Unary Algebras
• Classes closed under isomorphisms, retractions, and products
• Embedding graphs as isometric medians
• Absolute reflexive retracts and absolute bipartite retracts
• Absolute retracts of bipartite graphs
• Retracts of infinite Hamming graphs
• Bootstrap percolation in strong products of graphs
• Dismantling absolute retracts of reflexive graphs
• Obituary: Ivan Rival
• A syntactic approach to the MacNeille completion of \(\Lambda^\ast\), the free monoid over an ordered alphabet \(\Lambda\)
• Holes in ordered sets
• Absolute retracts of split graphs
• Injective envelope of graphs and transition systems

This page was built for publication: The smallest graph variety containing all paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1838985)