On the odd girth and the circular chromatic number of generalized Petersen graphs
From MaRDI portal
Publication:2359794
DOI10.1007/s10878-016-0013-0zbMath1398.90134arXiv1501.06551OpenAlexW1488300609WikidataQ114225861 ScholiaQ114225861MaRDI QIDQ2359794
Publication date: 22 June 2017
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.06551
Related Items (2)
Determining the edge metric dimension of the generalized Petersen graph \(P(n, 3)\) ⋮ On the minimum vertex cover of generalized Petersen graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On cylindrical graph construction and its applications
- Density and power graphs in graph homomorphism problem
- The isomorphism classes of the generalized Petersen graphs
- On colorings of graph powers
- Graph homomorphisms into the five-cycle
- The circular chromatic number of series-parallel graphs of large odd girth
- Homomorphisms from sparse graphs with large girth.
- Random cubic graphs are not homomorphic to the cycle of size 7
- Regular graphs with no homomorphisms onto cycles
- High-girth graphs avoiding a minor are nearly bipartite
- Isomorphism checking of \(I\)-graphs
- Aspects of structural combinatorics. (Graph homomorphisms and their use)
- Graph powers and graph homomorphisms
- Circular \((5,2)\)-coloring of sparse graphs
- The circular chromatic index of Goldberg snarks
- On the Circular Chromatic Number of Graph Powers
- ALL GENERALIZED PETERSEN GRAPHS ARE UNIT-DISTANCE GRAPHS
- Star chromatic number
- Which generalized petersen graphs are cayley graphs?
- A theorem on tait colorings with an application to the generalized Petersen graphs
- I-graphs and the corresponding configurations
- Self-dual configurations and regular graphs
- Circular chromatic number: A survey
- Colorings and homomorphisms of degenerate and bounded degree graphs
This page was built for publication: On the odd girth and the circular chromatic number of generalized Petersen graphs
