On cylindrical graph construction and its applications

zbMath1331.05205MaRDI QIDQ252833

Meysam Madani, Mohsen Hejrati, Amir Daneshgar

Publication date: 4 March 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i1p29

zbMATH Keywords

extremal problemsgraph homomorphismgeneralized Petersen graphadjoint functorcategory of graphsCoxeter-like graphscylindrical constructiongeneralized Mycielski constructionlabeled and marked graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph operations (line graphs, products, etc.) (05C76)

Related Items

On the odd girth and the circular chromatic number of generalized Petersen graphs, A class of highly symmetric graphs, symmetric cylindrical constructions and their spectra, On cylindrical graph construction and its applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On cylindrical graph construction and its applications
• Hyperedge replacement: grammars and languages
• Random graph coverings. I: General theory and graph connectivity
• On an upper bound of the graph's chromatic number, depending on the graph's degree and density
• Circular chromatic numbers of Mycielski's graphs
• Circular chromatic number and a generalization of the construction of Mycielski.
• Entropy waves, the zig-zag graph product, and new constant-degree expanders
• Aspects of structural combinatorics. (Graph homomorphisms and their use)
• Decompositions of edge-colored complete graphs
• Interlacing families. I: Bipartite Ramanujan graphs of all degrees
• Graph powers and graph homomorphisms
• The circular chromatic index of Goldberg snarks
• Forcing Structures and Cliques in Uniquely Vertex Colorable Graphs
• Function simulation, graph grammars and colourings
• Adjoint functors and tree duality
• Graph homomorphisms through random walks
• A Combinatorial Classic — Sparse Graphs with High Chromatic Number
• The right adjoints into the categories of relational systems
• Relations among the fractional chromatic, choice, Hall, and Hall-condition numbers of simple graphs