On cylindrical graph construction and its applications

MaRDI QIDQ252833zbMATH OpenFDO

Authors Mohsen Hejrati, Meysam Madani, 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

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

adjoint functorcategory of graphsCoxeter-like graphscylindrical constructionextremal problemsgeneralized Mycielski constructiongeneralized Petersen graphgraph homomorphismlabeled and marked graphs

Mathematics Subject Classification ID

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

Recommendations

• Publication:3487422
• A class of highly symmetric graphs, symmetric cylindrical constructions and their spectra
• scientific article; zbMATH DE number 1545696
• Construction of sparse graphs with prescribed circular colorings
• Symmetry properties of generalized graph truncations

Cites work

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

Cited in

(3)

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

This page was built for publication: On cylindrical graph construction and its applications

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