Publisher： Elsevier
Founded in： 1966
Total resources： 4
E-ISSN： 1096-0902
ISSN： 0095-8956
Subject： O13 Higher Mathematics
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Journal of Combinatorial Theory, Series B
Menu
Infinitely many finite one-regular graphs of any even valency
By Kwak J.H., Oh J.-M. in (2004)
Journal of Combinatorial Theory, Series B , Vol. 90, Iss. 1, 2004-01 , pp.
Access to resources
Recommend
The class of binary matroids with no M(K 3,3 )-, M * (K 3,3 )-, M(K 5 )- or M * (K 5 )-minor
Journal of Combinatorial Theory, Series B , Vol. 90, Iss. 1, 2004-01 , pp.By Balister P.N., Kostochka A., Li H., Schelp R.H. in (2004)
Journal of Combinatorial Theory, Series B , Vol. 90, Iss. 1, 2004-01 , pp.On sparse graphs with given colorings and homomorphisms
By Nesetril J., Zhu X. in (2004)
Journal of Combinatorial Theory, Series B , Vol. 90, Iss. 1, 2004-01 , pp.Homomorphisms from sparse graphs with large girth
By Borodin O.V., Kim S.-J., Kostochka A.V., West D.B. in (2004)
Journal of Combinatorial Theory, Series B , Vol. 90, Iss. 1, 2004-01 , pp.On the number of edges not covered by monochromatic copies of a fixed graph
By Keevash P., Sudakov B. in (2004)
Journal of Combinatorial Theory, Series B , Vol. 90, Iss. 1, 2004-01 , pp.On classifying finite edge colored graphs with two transitive automorphism groups
Journal of Combinatorial Theory, Series B , Vol. 90, Iss. 1, 2004-01 , pp.A new inequality for bipartite distance-regular graphs
Journal of Combinatorial Theory, Series B , Vol. 90, Iss. 1, 2004-01 , pp.Edge-disjoint odd cycles in planar graphs
By Kral' D., Voss H.-J. in (2004)
Journal of Combinatorial Theory, Series B , Vol. 90, Iss. 1, 2004-01 , pp.A simple competitive graph coloring algorithm II
By Dunn C., Kierstead H.A. in (2004)
Journal of Combinatorial Theory, Series B , Vol. 90, Iss. 1, 2004-01 , pp.
Previous
Next