Density and power graphs in graph homomorphism problem
type: Item
instance of: scholarly article
title: Density and power graphs in graph homomorphism problem
zbMATH Open document ID: 1145.05313
author: Amir Daneshgar
author: Hossein Hajiabolhassan
published in: Discrete Mathematics
publication date: 2008-07-11T00:00:00Z
Mathematics Subject Classification ID: 05C60
zbMATH DE Number: 5300662
zbMATH Keywords: graph homomorphism
zbMATH Keywords: power graph
zbMATH Keywords: density
zbMATH Keywords: pentagon conjecture
MaRDI profile type: Publication
full work available at URL: j.disc.2007.07.090
OpenAlex ID: W2094208704
cites work: A note on the star chromatic number
cites work: Graph homomorphisms through random walks
cites work: Q4660719
cites work: Circular colouring and algebraic no-homomorphism theorems
cites work: Q4352272
cites work: Random cubic graphs are not homomorphic to the cycle of size 7
cites work: Q4828516
cites work: Colorings and homomorphisms of degenerate and bounded degree graphs
cites work: Kneser's conjecture, chromatic number, and homotopy
cites work: Aspects of structural combinatorics. (Graph homomorphisms and their use)
cites work: Q5692719
cites work: Q4382863
cites work: Multiplicative graphs and semi-lattice endomorphisms in the category of graphs
cites work: Star chromatic number
cites work: Regular graphs with no homomorphisms onto cycles
cites work: Circular chromatic number: A survey
DOI: 10.1016/J.DISC.2007.07.090
description: scientific article; zbMATH DE number 5300662