MISC

2001年3月

Factorization of de Bruijn digraphs by cycle-rooted trees

INFORMATION PROCESSING LETTERS
  • H Kawai
  • ,
  • N Fujikake
  • ,
  • Y Shibata

77
5-6
開始ページ
269
終了ページ
275
記述言語
英語
掲載種別
DOI
10.1016/S0020-0190(00)00157-5
出版者・発行元
ELSEVIER SCIENCE BV

In this paper, we introduce a new concept of an arc-coloring of digraphs called in-coloring. An in-coloring of an in-regular digraph induces a factorization into cycle-rooted trees; a cycle-rooted tree is a weakly connected digraph in which every vertex has indegree one. In particular, we study in-colorings of a line digraph. The results interpolate one-factorizations: and tree factorizations of the de Bruijn digraph. (C) 2001 Elsevier Science B.V. All rights reserved.

Web of Science ® 被引用回数 : 6

リンク情報
DOI
https://doi.org/10.1016/S0020-0190(00)00157-5
CiNii Articles
http://ci.nii.ac.jp/naid/10025249560
Web of Science
https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=JSTA_CEL&SrcApp=J_Gate_JST&DestLinkType=FullRecord&KeyUT=WOS:000168887100008&DestApp=WOS_CPL

エクスポート
BibTeX RIS