نتایج جستجو برای: non regular graphs
تعداد نتایج: 1503387 فیلتر نتایج به سال:
Journal:
:Electronic Notes in Theoretical Computer Science
2019
Journal:
:The Electronic Journal of Combinatorics
2000
Journal:
:Journal of Discrete Mathematical Sciences and Cryptography
2018
Journal:
:Discrete Applied Mathematics
2022
A graph is called homogeneously traceable if every vertex an endpoint of a Hamilton path. In 1979 Chartrand, Gould and Kapoor proved that for integer n≥9, there exists nonhamiltonian order n. The graphs they constructed are irregular. Thus it natural to consider the existence problem regular graphs. We prove two results: (1) For even n≥10, cubic n; (2) p≥18, 4-regular p circumference p−4. Unsol...
Journal:
:Journal of Combinatorial Theory, Series B
1988
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید