메뉴 건너뛰기




Volumn 306, Issue 16, 2006, Pages 1947-1954

The deficiency of a regular graph

(1)  Schwartz, Alexander a  

a NONE

Author keywords

Consecutive coloring; Deficiency; Interval coloring

Indexed keywords

COLORING; INTEGER PROGRAMMING; NUMBER THEORY;

EID: 33746764967     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2006.03.059     Document Type: Article
Times cited : (17)

References (4)
  • 1
    • 0002009431 scopus 로고
    • Interval colorings of the edges of a multigraph
    • (in Russian)
    • Asratian A.S., and Kamalian R.R. Interval colorings of the edges of a multigraph. Appl. Math. 5 (1987) 25-34 (in Russian)
    • (1987) Appl. Math. , vol.5 , pp. 25-34
    • Asratian, A.S.1    Kamalian, R.R.2
  • 2
    • 0038873932 scopus 로고    scopus 로고
    • The complexity of consecutive Δ-coloring of bipartite graphs: 4 is easy, 5 is hard
    • Giaro K. The complexity of consecutive Δ-coloring of bipartite graphs: 4 is easy, 5 is hard. Ars Combin. 47 (1997) 287-298
    • (1997) Ars Combin. , vol.47 , pp. 287-298
    • Giaro, K.1
  • 4
    • 0035815959 scopus 로고    scopus 로고
    • Consecutive colorings of the edges of general graphs
    • Giaro K., Kubale M., and Małafiejski M. Consecutive colorings of the edges of general graphs. Discrete Math. 236 (2001) 131-143
    • (2001) Discrete Math. , vol.236 , pp. 131-143
    • Giaro, K.1    Kubale, M.2    Małafiejski, M.3


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