Item request has been placed!

Item request cannot be made.

Processing Request

نتائج البحث

Display Settings

النتائج لكل صفحة: 10

Sort By: Relevance

Filter

فلترة النتائج

Publication : journal of graph theory Subject : 05d10 Subject : complete graphs Subject : enumeration Subject : graph coloring Subject : hamiltonian graph theory Subject : mathematical bounds Subject : paths & cycles in graph theory فلترة بواسطة : موضوع

إعادة تعيين خيارات الفبترة

Item request has been placed!

Item request cannot be made.

Processing Request

Academic Journal

The (t−1) $(t-1)$‐chromatic Ramsey number for paths.

Authors : Bucić, Matija^1,2 (AUTHOR) ; Khamseh, Amir³ (AUTHOR)

Source: Journal of Graph Theory. Apr2023, Vol. 102 Issue 4, p784-796. 13p.

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

Academic Journal

A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs.

Authors : Zhai, Mingqing¹ (AUTHOR); Lin, Huiqiu² (AUTHOR)

Source: Journal of Graph Theory. Mar2023, Vol. 102 Issue 3, p502-520. 19p.

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

Academic Journal

Anti‐Ramsey number of expansions of paths and cycles in uniform hypergraphs.

Authors : Tang, Yucong^1,2 (AUTHOR); Li, Tong³ (AUTHOR); Yan, Guiying^3,4 (AUTHOR)

Source: Journal of Graph Theory. Dec2022, Vol. 101 Issue 4, p668-685. 18p.

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

Academic Journal

Turán‐ and Ramsey‐type results for unavoidable subgraphs.

Authors : Müyesser, Alp¹ (AUTHOR); Tait, Michael² (AUTHOR)

Source: Journal of Graph Theory. Dec2022, Vol. 101 Issue 4, p597-622. 26p.

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

Academic Journal

Gallai–Ramsey number for K5 ${K}_{5}$.

Authors : Magnant, Colton^1,2 (AUTHOR) ; Schiermeyer, Ingo³ (AUTHOR)

Source: Journal of Graph Theory. Nov2022, Vol. 101 Issue 3, p455-492. 38p.

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

Academic Journal

The Erdős–Gyárfás function with respect to Gallai‐colorings.

Authors : Li, Xihe^1,2 (AUTHOR); Broersma, Hajo² (AUTHOR) ; Wang, Ligong¹ (AUTHOR)

Source: Journal of Graph Theory. Oct2022, Vol. 101 Issue 2, p242-264. 23p.

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

Academic Journal

Ramsey numbers of trails and circuits.

Authors : Conlon, David¹ (AUTHOR); Tyomkyn, Mykhaylo² (AUTHOR)

Source: Journal of Graph Theory. Jan2023, Vol. 102 Issue 1, p194-196. 3p.

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

Academic Journal

Unavoidable chromatic patterns in 2‐colorings of the complete graph.

Authors : Caro, Yair¹ (AUTHOR); Hansberg, Adriana² (AUTHOR) ; Montejano, Amanda³ (AUTHOR)

Source: Journal of Graph Theory. May2021, Vol. 97 Issue 1, p123-147. 25p.

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

Academic Journal

On induced Ramsey numbers for multiple copies of graphs.

Authors : Axenovich, Maria¹ (AUTHOR); Gorgol, Izolda² (AUTHOR)

Source: Journal of Graph Theory. Nov2020, Vol. 95 Issue 3, p398-409. 12p.

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

Academic Journal

Rainbow saturation of graphs.

Authors : Girão, António¹; Lewis, David²; Popielarz, Kamil²

Source: Journal of Graph Theory. Jul2020, Vol. 94 Issue 3, p421-444. 24p.

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

نتائج البحث

فلترة النتائج

The (t−1) $(t-1)$‐chromatic Ramsey number for paths.

A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs.

Anti‐Ramsey number of expansions of paths and cycles in uniform hypergraphs.

Turán‐ and Ramsey‐type results for unavoidable subgraphs.

Gallai–Ramsey number for K5 ${K}_{5}$.

The Erdős–Gyárfás function with respect to Gallai‐colorings.

Ramsey numbers of trails and circuits.

Unavoidable chromatic patterns in 2‐colorings of the complete graph.

On induced Ramsey numbers for multiple copies of graphs.

Rainbow saturation of graphs.

اتصل بنا

اتبع