Period of time： 2004年1期
Publisher： Elsevier
Founded in： 1966
Total resources： 4
ISSN： 0095-8956
Subject： O1 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,volume 90,issue 1
Menu
By Balister P.N., Kostochka A., Li H., Schelp R.H. in (2004)
Journal of Combinatorial Theory, Series B,volume 90,issue 1 , Vol. 90, Iss. 1, 2004-01 , pp.
Access to resources
Recommend
Arrangements, circular arrangements and the crossing number of C 7 xC n
By Adamsson J., Richter R.B. in (2004)
Journal of Combinatorial Theory, Series B,volume 90,issue 1 , 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,volume 90,issue 1 , Vol. 90, Iss. 1, 2004-01 , pp.A new inequality for bipartite distance-regular graphs
Journal of Combinatorial Theory, Series B,volume 90,issue 1 , 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,volume 90,issue 1 , 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,volume 90,issue 1 , Vol. 90, Iss. 1, 2004-01 , pp.Reduction of the 5-Flow Conjecture to cyclically 6-edge-connected snarks
Journal of Combinatorial Theory, Series B,volume 90,issue 1 , 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,volume 90,issue 1 , 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,volume 90,issue 1 , Vol. 90, Iss. 1, 2004-01 , pp.
Previous
Next