PRODUCTS AND RETRACTS

Autor: Hell, Pavol, author, Nešetřil, Jaroslav, author

Publikováno v: Graphs and Homomorphisms, 2004, ill.

Externí odkaz: https://doi.org/10.1093/acprof:oso/9780198528173.003.0002

Some spectral and quasi-spectral characterizations of distance-regular graphs

Autor: E.R. van Dam, Miguel Angel Fiol, Aida Abiad

Publikováno v: Journal of Combinatorial Theory, Series A, Structures designs and application combinatorics, 143, 1-18. Academic Press Inc.
Recercat. Dipósit de la Recerca de Catalunya
instname
Journal of Combinatorial Theory Series A, 143, 1-18. Academic Press Inc.
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)

© . This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/ In this paper we consider the concept of preintersection numbers of a graph. These numbers are determined by the spectr

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6cbb0670a34ac8a37ca1333da213b8dc
https://research.tilburguniversity.edu/en/publications/4b8f3821-6159-4e1e-a9c2-e87f1ff0d688

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Lower bounds on the independence number of certain graphs of odd girth at least seven

Autor: Dieter Rautenbach, Friedrich Regen, Anders Sune Pedersen

Publikováno v: Pedersen, A S, Rautenbach, D & Regen, F 2011, ' Lower bounds on the independence number of certain graphs of odd girth at least seven ', Discrete Applied Mathematics, vol. 159, no. 2-3, pp. 143-151 . https://doi.org/10.1016/j.dam.2010.10.011

Heckman and Thomas [C.C. Heckman, R. Thomas, A new proof of the independence ratio of triangle-free cubic graphs, Discrete Math. 233 (2001) 233-237] proved that every connected subcubic triangle-free graph G has an independent set of order at least (

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::08bdccf0ff0dda67aad11954d883caee

The circular chromatic number of series-parallel graphs of large odd girth

Autor: Zhishi Pan, Xuding Zhu

Publikováno v: Discrete Mathematics. 245(1-3):235-246

Suppose G is a series-parallel graph. We prove that if G has odd girth at least 6k - 1 then χc(G) ≤ 8k/(4k - 1); if G has odd girth at least 6k + 1 then χc(G) ≤ (4k + 1)/2k; if G has odd girth at least 6k + 3 then χc(G) ≤ (4k + 3)/(2k + 1).

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c21d7819f2bfeb00a05139be5b53ac1b