Zobrazeno 1 - 10
of 29
pro vyhledávání: '"Ramamurthi, Radhika"'
Given graphs G and H with V(G) containing V(H), suppose that we have a u,v-path P_{uv} in G for each edge uv in H. There are obvious additional conditions that ensure that G contains H as a rooted subgraph, subdivision, or immersion; we seek conditio
Externí odkaz:
http://arxiv.org/abs/1207.6141
Autor:
Ramamurthi Radhika, Sanders Gina
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 39, Iss 4, Pp 899-908 (2019)
A proper coloring of the vertices of a graph is called a star coloring if at least three colors are used on every 4-vertex path. We show that all outerplanar bipartite graphs can be star colored using only five colors and construct the smallest known
Externí odkaz:
https://doaj.org/article/6d071fc585a442f18956bd46f6525c13
Autor:
Galvin, Fred, Ramamurthi, Radhika
Publikováno v:
The American Mathematical Monthly, 2001 Oct 01. 108(8), 773-774.
Externí odkaz:
https://www.jstor.org/stable/2695634
Autor:
Ramamurthi, Radhika, West, Douglas B.
Publikováno v:
In Discrete Mathematics 2004 274(1):233-240
Autor:
Kündgen, André 11Research was done as a postdoctoral fellow at The Fields Institute, Toronto, Ontario M5T 3J1, on the NSERC grant of Derek Corneil., Ramamurthi, Radhika 22Research was done as a graduate student at the University of Illinois, Urbana-Champaign, IL 61801, under the supervision of Douglas B. West.
Publikováno v:
In Journal of Combinatorial Theory, Series B July 2002 85(2):307-337
Autor:
Ramamurthi, Radhika, West, Douglas B.
Publikováno v:
In Electronic Notes in Discrete Mathematics 2002 11:542-549
Publikováno v:
The American Mathematical Monthly, 2003 Oct 01. 110(8), 747-747.
Externí odkaz:
https://www.jstor.org/stable/3647871
Autor:
Kündgen, André, Ramamurthi, Radhika
Publikováno v:
The American Mathematical Monthly, 2002 Jan 01. 109(1), 78-78.
Externí odkaz:
https://www.jstor.org/stable/2695778
Given graphs G and H with V(G) containing V(H), suppose that we have a u,v-path P_{uv} in G for each edge uv in H. There are obvious additional conditions that ensure that G contains H as a rooted subgraph, subdivision, or immersion; we seek conditio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dbac298082d0230a6071d3a0db8dc6ae
http://arxiv.org/abs/1207.6141
http://arxiv.org/abs/1207.6141
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.