Search the digital library catalog

Query:	search in
	search in
	search in
	search in
Work type:	* old and bologna study programme
Language:
Search in:
Options:	Show only hits with full text
	Reset

1 - 3 / 3

Abstract: Obravnavana so vozliščna, povezavna in skupna barvanja grafov Sierpińskijevih rešetk ▫$S_n$▫, Sierpińskijevih grafov ▫$S(n,k)$▫, grafov ▫$S^+(n,k)$▫ in grafov ▫$S^{++}(n,k)$▫. V posebnem je dokazano, da velja ▫$chi''(S_n)$▫, ▫$chi'(S(n,k))$▫, ▫$chi(S^+(n,k))$▫, ▫$chi(S^{++}(n,k))$▫, ▫$chi'(S^+(n,k))$▫ in ▫$chi'(S^{++}(n,k))$▫.
Keywords: matematika, teorija grafov, Sierpińskijeve rešetke, Sierpińskijevi grafi, kromatično število, kromatični indeks, skupno kromatično število, mathematics, graph theory, Sierpiński gasket graphs, Sierpiński graphs, chromatic number, chromatic index, total chromatic number
Published in DKUM: 10.07.2015; Views: 1075; Downloads: 95
Link to full text

Abstract: We prove the following theorem: if the Behzad-Vizing conjecture is true for graphs ▫$G$▫ and ▫$H$▫, then is it true for the cartesian product ▫$G Box H$▫.
Keywords: matematika, teorija grafov, kartezični produkt grafov, kromatično število, popolno kromatično število, Vizingova domneva, mathematics, graph theory, Cartesian graph product, chromatic number, total chromatic number, Vizing conjecture
Published in DKUM: 10.07.2015; Views: 1548; Downloads: 87
Link to full text

Keywords: graph theory, total chromatic number, direct product, tensor product
Published in DKUM: 07.06.2012; Views: 2168; Downloads: 93
Link to full text

Search done in 0.07 sec.