Lin, Shangwei; Jin, Ya’nan; Li, Chunfang Cartesian product digraphs with optimal restricted arc connectivity. (English) Zbl 1476.05098 Inf. Process. Lett. 134, 72-75 (2018). MSC: 05C40 05C20 05C76 PDFBibTeX XMLCite \textit{S. Lin} et al., Inf. Process. Lett. 134, 72--75 (2018; Zbl 1476.05098) Full Text: DOI
Sun, Zhiren; Zhou, Sizhong A generalization of orthogonal factorizations in digraphs. (English) Zbl 1429.05171 Inf. Process. Lett. 132, 49-54 (2018). MSC: 05C70 05C20 05C82 PDFBibTeX XMLCite \textit{Z. Sun} and \textit{S. Zhou}, Inf. Process. Lett. 132, 49--54 (2018; Zbl 1429.05171) Full Text: DOI
Xu, Chuandong; Zhang, Shenggui; Wang, Yi On the maximum arc-chromatic number of digraphs with bounded outdegrees or indegrees. (English) Zbl 1338.05095 Inf. Process. Lett. 115, No. 12, 939-944 (2015). MSC: 05C15 05C20 05C07 PDFBibTeX XMLCite \textit{C. Xu} et al., Inf. Process. Lett. 115, No. 12, 939--944 (2015; Zbl 1338.05095) Full Text: DOI
Croitoru, Cosmina A note on quasi-kernels in digraphs. (English) Zbl 1332.05060 Inf. Process. Lett. 115, No. 11, 863-865 (2015). MSC: 05C20 05C85 68Q17 PDFBibTeX XMLCite \textit{C. Croitoru}, Inf. Process. Lett. 115, No. 11, 863--865 (2015; Zbl 1332.05060) Full Text: DOI
Ning, Bo Notes on a conjecture of Manoussakis concerning Hamilton cycles in digraphs. (English) Zbl 1304.05090 Inf. Process. Lett. 115, No. 2, 221-224 (2015). MSC: 05C45 05C20 PDFBibTeX XMLCite \textit{B. Ning}, Inf. Process. Lett. 115, No. 2, 221--224 (2015; Zbl 1304.05090) Full Text: DOI arXiv
Lien, Min-Yun; Kuo, Jyhmin; Fu, Hung-Lin On the decycling number of generalized Kautz digraphs. (English) Zbl 1304.05062 Inf. Process. Lett. 115, No. 2, 209-211 (2015). MSC: 05C20 05C82 PDFBibTeX XMLCite \textit{M.-Y. Lien} et al., Inf. Process. Lett. 115, No. 2, 209--211 (2015; Zbl 1304.05062) Full Text: DOI
Liang, Hao; Xu, Jun-Ming Minimum feedback arc set of \(m\)-free digraphs. (English) Zbl 1273.05088 Inf. Process. Lett. 113, No. 8, 260-264 (2013). MSC: 05C20 05C38 PDFBibTeX XMLCite \textit{H. Liang} and \textit{J.-M. Xu}, Inf. Process. Lett. 113, No. 8, 260--264 (2013; Zbl 1273.05088) Full Text: DOI arXiv
Rizzi, Romeo; Tomescu, Alexandru I. Ranking, unranking and random generation of extensional acyclic digraphs. (English) Zbl 1259.05172 Inf. Process. Lett. 113, No. 5-6, 183-187 (2013). MSC: 05C85 05C20 PDFBibTeX XMLCite \textit{R. Rizzi} and \textit{A. I. Tomescu}, Inf. Process. Lett. 113, No. 5--6, 183--187 (2013; Zbl 1259.05172) Full Text: DOI
Chen, Xing; Liu, Juan; Meng, Jixiang \(\lambda^{\prime}\)-optimality of bipartite digraphs. (English) Zbl 1248.68104 Inf. Process. Lett. 112, No. 17-18, 701-705 (2012). MSC: 68M15 68R10 05C40 05C20 PDFBibTeX XMLCite \textit{X. Chen} et al., Inf. Process. Lett. 112, No. 17--18, 701--705 (2012; Zbl 1248.68104) Full Text: DOI
Guo, Deke; Zhu, Guiming; Jin, Hai; Yang, Panlong; Chen, Yingwen; Yi, Xianqing; Liu, Junxian Möbius-deBruijn: the product of Möbius cube and deBruijn digraph. (English) Zbl 1250.68064 Inf. Process. Lett. 112, No. 5, 205-211 (2012). Reviewer: Jerzy Żurawiecki (Lublin) MSC: 68M10 68R10 68M07 PDFBibTeX XMLCite \textit{D. Guo} et al., Inf. Process. Lett. 112, No. 5, 205--211 (2012; Zbl 1250.68064) Full Text: DOI
Borowiecki, Mieczysław; Grytczuk, Jarosław; Pilśniak, Monika Coloring chip configurations on graphs and digraphs. (English) Zbl 1232.05074 Inf. Process. Lett. 112, No. 1-2, 1-4 (2012). MSC: 05C15 05C20 05C85 PDFBibTeX XMLCite \textit{M. Borowiecki} et al., Inf. Process. Lett. 112, No. 1--2, 1--4 (2012; Zbl 1232.05074) Full Text: DOI EuDML
Policriti, Alberto; Tomescu, Alexandru I. Counting extensional acyclic digraphs. (English) Zbl 1260.05077 Inf. Process. Lett. 111, No. 16, 787-791 (2011). MSC: 05C30 05C20 PDFBibTeX XMLCite \textit{A. Policriti} and \textit{A. I. Tomescu}, Inf. Process. Lett. 111, No. 16, 787--791 (2011; Zbl 1260.05077) Full Text: DOI
Andres, Stephan Dominique; Hochstättler, Winfried The game chromatic number and the game colouring number of classes of oriented cactuses. (English) Zbl 1260.91037 Inf. Process. Lett. 111, No. 5, 222-226 (2011). MSC: 91A43 05C85 05C20 05C15 PDFBibTeX XMLCite \textit{S. D. Andres} and \textit{W. Hochstättler}, Inf. Process. Lett. 111, No. 5, 222--226 (2011; Zbl 1260.91037) Full Text: DOI
Guo, Deke; Chen, Hanhua; He, Yuan; Jin, Hai; Chen, Chao; Chen, Honghui; Shu, Zhen; Huang, Guangqi KCube: a novel architecture for interconnection networks. (English) Zbl 1234.68025 Inf. Process. Lett. 110, No. 18-19, 821-825 (2010). MSC: 68M10 68R10 05C82 PDFBibTeX XMLCite \textit{D. Guo} et al., Inf. Process. Lett. 110, No. 18--19, 821--825 (2010; Zbl 1234.68025) Full Text: DOI
Zhang, Xindong; Liu, Juan; Meng, Jixiang The bondage number in complete \(t\)-partite digraphs. (English) Zbl 1197.05069 Inf. Process. Lett. 109, No. 17, 997-1000 (2009). MSC: 05C20 05C69 PDFBibTeX XMLCite \textit{X. Zhang} et al., Inf. Process. Lett. 109, No. 17, 997--1000 (2009; Zbl 1197.05069) Full Text: DOI
Dankelmann, Peter; Volkmann, Lutz Minimum size of a graph or digraph of given radius. (English) Zbl 1197.05076 Inf. Process. Lett. 109, No. 16, 971-973 (2009). MSC: 05C35 05C20 05C12 PDFBibTeX XMLCite \textit{P. Dankelmann} and \textit{L. Volkmann}, Inf. Process. Lett. 109, No. 16, 971--973 (2009; Zbl 1197.05076) Full Text: DOI
Skowronek-Kaziów, Joanna Some digraphs arising from number theory and remarks on the zero-divisor graph of the ring \(Z_n\). (English) Zbl 1189.05070 Inf. Process. Lett. 108, No. 3, 165-169 (2008). MSC: 05C20 05C25 05C35 05C85 11A07 PDFBibTeX XMLCite \textit{J. Skowronek-Kaziów}, Inf. Process. Lett. 108, No. 3, 165--169 (2008; Zbl 1189.05070) Full Text: DOI
Shan, Erfang; Cheng, T. C. E.; Kang, Liying Absorbant of generalized de Bruijn digraphs. (English) Zbl 1184.68361 Inf. Process. Lett. 105, No. 1, 6-11 (2008). MSC: 68R10 PDFBibTeX XMLCite \textit{E. Shan} et al., Inf. Process. Lett. 105, No. 1, 6--11 (2008; Zbl 1184.68361) Full Text: DOI
Araki, Toru On the \(k\)-tuple domination of de Bruijn and Kautz digraphs. (English) Zbl 1183.05029 Inf. Process. Lett. 104, No. 3, 86-90 (2007). MSC: 05C20 05C69 PDFBibTeX XMLCite \textit{T. Araki}, Inf. Process. Lett. 104, No. 3, 86--90 (2007; Zbl 1183.05029) Full Text: DOI
Tanaka, Yuuki; Kawai, Hiroyuki; Shibata, Yukio Isomorphic factorization, the Kronecker product and the line digraph. (English) Zbl 1185.05118 Inf. Process. Lett. 101, No. 2, 72-77 (2007). MSC: 05C70 68R10 68M10 PDFBibTeX XMLCite \textit{Y. Tanaka} et al., Inf. Process. Lett. 101, No. 2, 72--77 (2007; Zbl 1185.05118) Full Text: DOI
Isaak, Garth; Narayan, Darren A. A classification of tournaments having an acyclic tournament as a minimum feedback arc set. (English) Zbl 1175.05063 Inf. Process. Lett. 92, No. 3, 107-111 (2004). MSC: 05C20 PDFBibTeX XMLCite \textit{G. Isaak} and \textit{D. A. Narayan}, Inf. Process. Lett. 92, No. 3, 107--111 (2004; Zbl 1175.05063) Full Text: DOI Link
Nagamochi, Hiroshi; Ishii, Toshimasa; Ito, Hiro Minimum cost source location problem with vertex-connectivity requirements in digraphs. (English) Zbl 1003.68110 Inf. Process. Lett. 80, No. 6, 287-293 (2001). MSC: 68R10 05C35 05C85 05C20 PDFBibTeX XMLCite \textit{H. Nagamochi} et al., Inf. Process. Lett. 80, No. 6, 287--293 (2001; Zbl 1003.68110) Full Text: DOI
Kawai, H.; Fujikake, N.; Shibata, Y. Factorization of de Bruijn digraphs by cycle-rooted trees. (English) Zbl 0996.68128 Inf. Process. Lett. 77, No. 5-6, 269-275 (2001). MSC: 68R10 PDFBibTeX XMLCite \textit{H. Kawai} et al., Inf. Process. Lett. 77, No. 5--6, 269--275 (2001; Zbl 0996.68128) Full Text: DOI
Harbane, Rabah; Padró, Carles Spanners of underlying graphs of iterated line digraphs. (English) Zbl 1337.68208 Inf. Process. Lett. 62, No. 5, 237-244 (1997). MSC: 68R10 05C35 PDFBibTeX XMLCite \textit{R. Harbane} and \textit{C. Padró}, Inf. Process. Lett. 62, No. 5, 237--244 (1997; Zbl 1337.68208) Full Text: DOI
Heydemann, M. C.; Sotteau, D. A note on recursive properties of the de Bruijn, Kautz and FFT digraphs. (English) Zbl 0875.68683 Inf. Process. Lett. 53, No. 5, 255-259 (1995). MSC: 68R10 PDFBibTeX XMLCite \textit{M. C. Heydemann} and \textit{D. Sotteau}, Inf. Process. Lett. 53, No. 5, 255--259 (1995; Zbl 0875.68683) Full Text: DOI
Jimbo, Shuji; Maruoka, Akira On the relationship between the diameter and the size of a boundary of a directed graph. (English) Zbl 0799.05024 Inf. Process. Lett. 50, No. 5, 277-282 (1994). Reviewer: F.Gliviak (Bratislava) MSC: 05C20 68R10 05C35 PDFBibTeX XMLCite \textit{S. Jimbo} and \textit{A. Maruoka}, Inf. Process. Lett. 50, No. 5, 277--282 (1994; Zbl 0799.05024) Full Text: DOI
Eades, Peter; Lin, Xuemin; Smyth, W. F. A fast and effective heuristic for the feedback arc set problem. (English) Zbl 0787.68078 Inf. Process. Lett. 47, No. 6, 319-323 (1993). MSC: 68R10 68Q25 PDFBibTeX XMLCite \textit{P. Eades} et al., Inf. Process. Lett. 47, No. 6, 319--323 (1993; Zbl 0787.68078) Full Text: DOI
Chen, Wen-Huei; Tang, Chuan Yi A \(2\cdot | E |\)-bit distributed algorithm for the directed Euler trail problem. (English) Zbl 0833.68060 Inf. Process. Lett. 47, No. 1, 43-49 (1993). MSC: 68W15 68R10 PDFBibTeX XMLCite \textit{W.-H. Chen} and \textit{C. Y. Tang}, Inf. Process. Lett. 47, No. 1, 43--49 (1993; Zbl 0833.68060) Full Text: DOI
Amato, Nancy Improved processor bounds for parallel algorithms for weighted directed graphs. (English) Zbl 0768.68022 Inf. Process. Lett. 45, No. 3, 147-152 (1993). MSC: 68W15 68R10 PDFBibTeX XMLCite \textit{N. Amato}, Inf. Process. Lett. 45, No. 3, 147--152 (1993; Zbl 0768.68022) Full Text: DOI Link
Toda, Seinosuke On the complexity of topological sorting. (English) Zbl 0713.68025 Inf. Process. Lett. 35, No. 5, 229-233 (1990). Reviewer: T.Walsh MSC: 68Q15 68Q25 68R10 68Q10 PDFBibTeX XMLCite \textit{S. Toda}, Inf. Process. Lett. 35, No. 5, 229--233 (1990; Zbl 0713.68025) Full Text: DOI
Ebert, Jürgen Computing Eulerian trails. (English) Zbl 0658.68076 Inf. Process. Lett. 28, No. 2, 93-97 (1988). MSC: 68R10 68Q25 05C45 05C38 PDFBibTeX XMLCite \textit{J. Ebert}, Inf. Process. Lett. 28, No. 2, 93--97 (1988; Zbl 0658.68076) Full Text: DOI
Jajodia, Sushil On equivalence of relational and network database models. (English) Zbl 0564.68068 Inf. Process. Lett. 20, 51-54 (1985). Reviewer: J.Pokorný MSC: 68P20 68P05 PDFBibTeX XMLCite \textit{S. Jajodia}, Inf. Process. Lett. 20, 51--54 (1985; Zbl 0564.68068) Full Text: DOI
Simovici, Dan A.; Grigoras, Gh. Even initial feedback vertex set problem is NP-complete. (English) Zbl 0405.68045 Inf. Process. Lett. 8, 64-66 (1979). MSC: 68Q25 68Q45 05C38 05C20 PDFBibTeX XMLCite \textit{D. A. Simovici} and \textit{Gh. Grigoras}, Inf. Process. Lett. 8, 64--66 (1979; Zbl 0405.68045) Full Text: DOI