Then-ordered graphs: A new graph class

DOI10.1002/JGT.20352MaRDI QIDQ3608320zbMATH OpenOpenAlexFDO

Authors Anthony Bonato, Changping Wang, Jeannette Janssen

Publication date 4 March 2009

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.20352

zbMATH Keywords

\(n\)-ordered graph\(n\)-treeautomorphism groupcountably infinite graphsfolfing operationinfinite random graphrandom processweb graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Structural characterization of families of graphs (05C75) Random graphs (graph-theoretic aspects) (05C80) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Games involving graphs (91A43) Combinatorial games (91A46)

Recommendations

• The 42 reducts of the random ordered graph
• scientific article; zbMATH DE number 6930585
• Generating infinite random graphs
• Infinite Locally Random Graphs
• On retracts of the random graph and their natural order

Cites work

• A course on the web graph
• A family of countable homogeneous graphs
• Graph Classes: A Survey
• Infinite Limits of Copying Models of the Web Graph
• Isomorphism and embedding problems for infinite limits of scale-free graphs
• Vertex-to-vertex pursuit in a graph

Cited in

(3)

• Constructing order type graphs using an axiomatic approach
• The niche graphs of doubly partial orders
• Strongly \(n\)-e.c. graphs and independent distinguishing labellings

This page was built for publication: Then-ordered graphs: A new graph class

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