2-Reducible Two Paths and an Edge Constructing a Path in (2k + 1)-Edge-Connected Graphs

By Okamura Haruko  

Graphs and Combinatorics, Vol. 26, Iss. 4, 2010-07 ,pp. : 571-589

Springer Publishing Company

Access to resources Recommend Favorite

d-strong Edge Colorings of Graphs

By Kemnitz Arnfried   Marangio Massimiliano  

Graphs and Combinatorics, Vol. 30, Iss. 1, 2014-01 ,pp. : 183-195

Springer Publishing Company

Access to resources Recommend Favorite

On the Chromatic Number of the Square of the Kneser Graph K(2K+1, K)

By Kim Seog-Jin   Nakprasit Kittikorn  

Graphs and Combinatorics, Vol. 20, Iss. 1, 2004-03 ,pp. : 79-90

Springer Publishing Company

Access to resources Recommend Favorite

Continuum bound states K_L, D₁(2420), D_s1(2536), and their partners K_s, D₁(2400), D^*_sJ(2463)

By Beveren E.   Rupp G.  

The European Physical Journal C - Particles and Fields, Vol. 32, Iss. 4, 2004-02 ,pp. : 493-499

Springer Publishing Company

Access to resources Recommend Favorite

Automorphisms of Chevalley groups of types A _l , D _l , or E _l over local rings with 1/2

By Bunina E.  

Journal of Mathematical Sciences, Vol. 167, Iss. 6, 2010-06 ,pp. : 749-766

Springer Publishing Company

Access to resources Recommend Favorite