Density and power graphs in graph homomorphism problem

DOI10.1016/J.DISC.2007.07.090zbMath1145.05313OpenAlexW2094208704MaRDI QIDQ932664

Amir Daneshgar, Hossein Hajiabolhassan

Publication date: 11 July 2008

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

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

zbMATH Keywords

densitygraph homomorphismpower graphpentagon conjecture

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (3)

On the odd girth and the circular chromatic number of generalized Petersen graphs ⋮ Clawfreeness of the powers of a graph ⋮ On colorings of graph powers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Kneser's conjecture, chromatic number, and homotopy
• Random cubic graphs are not homomorphic to the cycle of size 7
• Regular graphs with no homomorphisms onto cycles
• Aspects of structural combinatorics. (Graph homomorphisms and their use)
• Circular colouring and algebraic no-homomorphism theorems
• Multiplicative graphs and semi-lattice endomorphisms in the category of graphs
• A note on the star chromatic number
• Star chromatic number
• Graph homomorphisms through random walks
• Circular chromatic number: A survey
• Colorings and homomorphisms of degenerate and bounded degree graphs

This page was built for publication: Density and power graphs in graph homomorphism problem