SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Journal of Combinatorial Theory. Series B

Volumn 80, Issue 1, 2000, Pages 147-155

Colored Homomorphisms of Colored Mixed Graphs

(2) Nešetřil, Jaroslav a Raspaud, André b

a CHARLES UNIVERSITY (Czech Republic)

b UNIVERSITÉ BORDEAUX 1 (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0013412041 PISSN: 00958956 EISSN: None Source Type: Journal
DOI: 10.1006/jctb.2000.1977 Document Type: Article

Times cited : (58)

References (13)

1
- 0039527992
- Homomorphisms of edge-coloured graphs and Coxeter groups
- Alon N., Marshall T. H. Homomorphisms of edge-coloured graphs and Coxeter groups. J. Algebraic Combin. 8:1998;5-13.
- (1998) J. Algebraic Combin. , vol.8 , pp. 5-13
- Alon, N.¹ Marshall, T.H.²

2
- 49249149212
- On acyclic colorings of planar graphs
- Borodin O. V. On acyclic colorings of planar graphs. Discrete Math. 25:1979;211-236.
- (1979) Discrete Math. , vol.25 , pp. 211-236
- Borodin, O.V.¹

3
- 0002654721
- On the maximum average degree and the oriented chromatic number of a graph
- Borodin O. V., Kostochka A. V., Nešetřil J., Raspaud A., Sopena E. On the maximum average degree and the oriented chromatic number of a graph. Discrete Math. 206:1999;77-89.
- (1999) Discrete Math. , vol.206 , pp. 77-89
- Borodin, O.V.¹ Kostochka, A.V.² Nešetřil, J.³ Raspaud, A.⁴ Sopena, E.⁵

4
- 0348050569
- On Hamilton circuits and Hamilton paths
- Dirac G. A. On Hamilton circuits and Hamilton paths. Math. Ann. 197:1972;57-70.
- (1972) Math. Ann. , vol.197 , pp. 57-70
- Dirac, G.A.¹

5
- 0013291622
- The complexity of harmonious coloring for trees
- Edwards K., McDiarmid C. The complexity of harmonious coloring for trees. Discrete Appl. Math. 57:1995;133-144.
- (1995) Discrete Appl. Math. , vol.57 , pp. 133-144
- Edwards, K.¹ McDiarmid, C.²

6
- 0004145084
- R. L. Graham, M. Grötschel, & L. Lovász. Cambridge, MA/North-Holland, Amsterdam: MIT Press
- Graham R. L., Grötschel M., Lovász L. Handbook of Combinatorics. 1995;MIT Press, Cambridge, MA/North-Holland, Amsterdam.
- (1995) Handbook of Combinatorics

7
- 0031518118
- Acyclic and oriented chromatic numbers of graphs
- Kostochka A. V., Sopena E., Zhu X. Acyclic and oriented chromatic numbers of graphs. J. Graph Theory. 14:1997;331-340.
- (1997) J. Graph Theory , vol.14 , pp. 331-340
- Kostochka, A.V.¹ Sopena, E.² Zhu, X.³

8
- 0005276984
- Paris: Gauthier-Villars
- Lucas D. E. Récréations mathématiques. 1892;Gauthier-Villars, Paris.
- (1892) Récréations Mathématiques
- Lucas, D.E.¹

9
- 0000281307
- Colorings and girth of oriented planar graphs
- Nešetřil J., Raspaud A., Sopena E. Colorings and girth of oriented planar graphs. Discrete Math. 165:1997;519-530.
- (1997) Discrete Math. , vol.165 , pp. 519-530
- Nešetřil, J.¹ Raspaud, A.² Sopena, E.³

10
- 23544450685
- submitted for publication
- J. Nešetřil, and, C. Tardif, Duality theorems for finite structures (characterizing gaps and characterization), submitted for publication.
- Duality Theorems for Finite Structures (Characterizing Gaps and Characterization)
- Nešetřil, J.¹ Tardif, C.²

11
- 0016974616
- On the complexity of edge traversing
- Papadimitriou Ch. H. On the complexity of edge traversing. J. Assoc. Comput. Mach. 23:1976;544-554.
- (1976) J. Assoc. Comput. Mach. , vol.23 , pp. 544-554
- Papadimitriou, Ch.H.¹

12
- 0028480028
- Good and semi-strong colorings of oriented planar graphs
- Raspaud A., Sopena E. Good and semi-strong colorings of oriented planar graphs. Inform. Process. Lett. 51:1994;171-174.
- (1994) Inform. Process. Lett. , vol.51 , pp. 171-174
- Raspaud, A.¹ Sopena, E.²

13
- 0031477218
- The chromatic number of oriented graphs
- Sopena E. The chromatic number of oriented graphs. J. Graph Theory. 25:1997;191-205.
- (1997) J. Graph Theory , vol.25 , pp. 191-205
- Sopena, E.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.