Generating sequences of clique-symmetric graphs via Eulerian digraphs

DOI10.1016/j.disc.2004.04.016zbMath1053.05062OpenAlexW2049790819MaRDI QIDQ1886344

T. D. Porter, John P. McSorley

Publication date: 18 November 2004

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

Full work available at URL: https://doi.org/10.1016/j.disc.2004.04.016

zbMATH Keywords

reconstructioncliqueEulerian digraphCayleyremoval

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: Generating sequences of clique-symmetric graphs via Eulerian digraphs