The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for digraphs with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1973-1978 (21) 1979-1980 (16) 1981-1982 (27) 1983-1984 (24) 1985 (16) 1986 (16) 1987 (17) 1988 (19) 1989 (15) 1990 (24) 1991 (21) 1992 (28) 1993 (30) 1994 (30) 1995 (40) 1996 (43) 1997 (51) 1998 (54) 1999 (46) 2000 (42) 2001 (47) 2002 (47) 2003 (68) 2004 (51) 2005 (61) 2006 (65) 2007 (87) 2008 (84) 2009 (100) 2010 (60) 2011 (67) 2012 (87) 2013 (94) 2014 (73) 2015 (114) 2016 (108) 2017 (123) 2018 (124) 2019 (117) 2020 (103) 2021 (112) 2022 (112) 2023 (113) 2024 (32)
Publication types (Num. hits)
article(2111) book(3) incollection(21) inproceedings(484) phdthesis(9) proceedings(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 265 occurrences of 194 keywords

Results
Found 2629 publication records. Showing 2629 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
12Mihails Milehins Category Theory for ZFC in HOL I: Foundations: Design Patterns, Set Theory, Digraphs, Semicategories. Search on Bibsonomy Arch. Formal Proofs The full citation details ... 2021 DBLP  BibTeX  RDF
12Hortensia Galeana-Sánchez, Eugenia O'Reilly Regueiro H-absorbence and H-independence in 3-quasi-transitive H-coloured digraphs. Search on Bibsonomy Contributions Discret. Math. The full citation details ... 2021 DBLP  BibTeX  RDF
12Katherina Böhmova, Cristina Dalfó, Clemens Huemer New cyclic Kautz digraphs with optimal diameter. Search on Bibsonomy Contributions Discret. Math. The full citation details ... 2021 DBLP  BibTeX  RDF
12Yanan Zhu, Wenwu Yu, Wei Ren 0001, Guanghui Wen, Juping Gu Generalized Nash Equilibrium Seeking via Continuous-Time Coordination Dynamics Over Digraphs. Search on Bibsonomy IEEE Trans. Control. Netw. Syst. The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
12Lei Shi 0012, Yuhua Cheng 0001, Jinliang Shao, Xilin Zhang Collective Behavior of Multileader Multiagent Systems With Random Interactions Over Signed Digraphs. Search on Bibsonomy IEEE Trans. Control. Netw. Syst. The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
12Chong-Xiao Shi, Guang-Hong Yang Distributed Optimization Under Unbalanced Digraphs With Node Errors: Robustness of Surplus-Based Dual Averaging Algorithm. Search on Bibsonomy IEEE Trans. Control. Netw. Syst. The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
12Pietro Caputo, Matteo Quattropani Mixing time of PageRank surfers on sparse random digraphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
12Selim Bahadir, Elvan Ceyhan On the Number of Weakly Connected Subdigraphs in Random kNN Digraphs. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
12Esmaeil Parsa, P. Mark Kayll On random digraphs and cores. Search on Bibsonomy Australas. J Comb. The full citation details ... 2021 DBLP  BibTeX  RDF
12S. Ganesamurthy, R. S. Manikandan, P. Paulraja Decompositions of some classes of regular graphs and digraphs into cycles of length 4p. Search on Bibsonomy Australas. J Comb. The full citation details ... 2021 DBLP  BibTeX  RDF
12Sho Kubota, Etsuo Segawa, Tetsuji Taniguchi Quantum walks defined by digraphs and generalized Hermitian adjacency matrices. Search on Bibsonomy Quantum Inf. Process. The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
12Zhenhua Lyu Digraphs that contain at most t distinct walks of a given length with the same endpoints. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
12Yingbin Ma, Kairui Nie (Strong) Total proper connection of some digraphs. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
12Alan M. Frieze, Wesley Pegden Maker Breaker on digraphs. Search on Bibsonomy J. Graph Theory The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
12Jesús Alva-Samos, César Hernández-Cruz k-quasi-transitive digraphs of large diameter. Search on Bibsonomy J. Graph Theory The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
12Guanwu Liu, Xingxing Yu Partitioning digraphs with outdegree at least 4. Search on Bibsonomy J. Graph Theory The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
12Mathew C. Francis, Pavol Hell, Dalu Jacob On the Kernel and Related Problems in Interval Digraphs. Search on Bibsonomy ISAAC The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
12Shiri Chechik, Tianyi Zhang 0008 Incremental Single Source Shortest Paths in Sparse Digraphs. Search on Bibsonomy SODA The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
12Manoj Changat, Prasanth G. Narasimha-Shenoi, Mary Shalet Thottungal Joseph Lexicographic Product of Digraphs and Related Boundary-Type Sets. Search on Bibsonomy CALDAM The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
12Abhinav Nellore, Austin Nguyen, Reid F. Thompson An Invertible Transform for Efficient String Matching in Labeled Digraphs. Search on Bibsonomy CPM The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
12Jacob Evald, Viktor Fredslund-Hansen, Maximilian Probst Gutenberg, Christian Wulff-Nilsen Decremental APSP in Unweighted Digraphs Versus an Adaptive Adversary. Search on Bibsonomy ICALP The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
12Muhammad Umar Javed, Jorge I. Poveda, Xudong Chen 0002 Excitation Conditions for Uniform ExponentiaGBl Stability of the Cooperative Gradient Algorithm over Weakly Connected Digraphs. Search on Bibsonomy ACC The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
12Wei Jiang 0014, Themistoklis Charalambous Distributed Alternating Direction Method of Multipliers using Finite-Time Exact Ratio Consensus in Digraphs. Search on Bibsonomy ECC The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
12Wei Jiang 0014, Andreas Grammenos, Evangelia Kalyvianaki, Themistoklis Charalambous An Asynchronous Approximate Distributed Alternating Direction Method of Multipliers in Digraphs. Search on Bibsonomy CDC The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
12Zeev Nutov On Rooted k-Connectivity Problems in Quasi-bipartite Digraphs. Search on Bibsonomy CSR The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
12Frank Gurski, Dominique Komander, Carolin Rehs, Sebastian Wiederrecht Directed Width Parameters on Semicomplete Digraphs. Search on Bibsonomy COCOA The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
12Frank Gurski, Dominique Komander, Marvin Lindemann Oriented Vertex and Arc Coloring of Edge Series-Parallel Digraphs. Search on Bibsonomy OR The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
12Jørgen Bang-Jensen, Thomas Bellitto, Thomas Schweser, Michael Stiebitz Hajós and Ore Constructions for Digraphs. Search on Bibsonomy Electron. J. Comb. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Louigi Addario-Berry, Borja Balle, Guillem Perarnau Diameter and Stationary Distribution of Random $r$-Out Digraphs. Search on Bibsonomy Electron. J. Comb. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Miroslav Olsák Loop conditions for strongly connected digraphs. Search on Bibsonomy Int. J. Algebra Comput. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Han Xiao 0003 On ideal semicomplete digraphs. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Martin Sonntag, Hanns-Martin Teichert Niche hypergraphs of products of digraphs. Search on Bibsonomy Discuss. Math. Graph Theory The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Nadia El Amri (≤ k)-hereditarily Reconstructible Digraphs. Search on Bibsonomy J. Multiple Valued Log. Soft Comput. The full citation details ... 2020 DBLP  BibTeX  RDF
12Inma P. Cabrera, Pablo Cordero, Emilio Muñoz-Velasco, Manuel Ojeda-Aciego, Bernard De Baets Relational Galois connections between transitive digraphs: Characterization and construction. Search on Bibsonomy Inf. Sci. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Camino Balbuena, Cristina Dalfó, Berenice Martínez-Barona Identifying codes in line digraphs. Search on Bibsonomy Appl. Math. Comput. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Changchang Dong, Juan Liu 0001, Jixiang Meng Supereulerian 3-path-quasi-transitive digraphs. Search on Bibsonomy Appl. Math. Comput. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Xinli Shi, Jinde Cao, Guanghui Wen, Xinghuo Yu 0001 Finite-Time Stability for Network Systems With Nonlinear Protocols Over Signed Digraphs. Search on Bibsonomy IEEE Trans. Netw. Sci. Eng. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Taihua Xu, Guoyin Wang 0001, Jie Yang 0052 Finding strongly connected components of simple digraphs based on granulation strategy. Search on Bibsonomy Int. J. Approx. Reason. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12David Gómez-Gutiérrez, Carlos Renato Vázquez, Sergej Celikovský, Juan Diego Sánchez-Torres, Javier Ruiz-León On finite-time and fixed-time consensus algorithms for dynamic networks switching among disconnected digraphs. Search on Bibsonomy Int. J. Control The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Satoshi Kawamura, Kai Cai, Mengbin Ye, Zhiyun Lin Tight bound on parameter of surplus-based averaging algorithm over balanced digraphs. Search on Bibsonomy Int. J. Control The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Pavol Hell, Jing Huang 0007, Ross M. McConnell, Arash Rafiey Min-Orderable Digraphs. Search on Bibsonomy SIAM J. Discret. Math. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Yichao Ao, Yingmin Jia Robust H2/H∞ group consensus control for linear clusters over signed digraphs. Search on Bibsonomy J. Frankl. Inst. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani 1-bend upward planar slope number of SP-digraphs. Search on Bibsonomy Comput. Geom. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Xinli Shi, Jinde Cao, Xinghuo Yu 0001, Guanghui Wen Finite-Time Stability of Network Systems With Discontinuous Dynamics Over Signed Digraphs. Search on Bibsonomy IEEE Trans. Autom. Control. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Seyyed Shaho Alaviani, Nicola Elia Distributed Multiagent Convex Optimization Over Random Digraphs. Search on Bibsonomy IEEE Trans. Autom. Control. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Xudong Chen 0002, Zuguang Gao, Tamer Basar Asymptotic Behavior of Conjunctive Boolean Networks Over Weakly Connected Digraphs. Search on Bibsonomy IEEE Trans. Autom. Control. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Jiaqi Zhang 0001, Keyou You AsySPA: An Exact Asynchronous Algorithm for Convex Optimization Over Digraphs. Search on Bibsonomy IEEE Trans. Autom. Control. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Paul D. Seymour, Sophie Spirkl Short Directed Cycles in Bipartite Digraphs. Search on Bibsonomy Comb. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Yufei Zhao, Yunkun Zhou Impartial Digraphs. Search on Bibsonomy Comb. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12James Usevitch, Dimitra Panagou Determining r- and (r, s)-robustness of digraphs using mixed integer linear programming. Search on Bibsonomy Autom. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Michael Albert, Cecilia Holmgren, Tony Johansson, Fiona Skerman Embedding Small Digraphs and Permutations in Binary Trees and Split Trees. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Paul Ellis, Attila Joó, Dániel T. Soukup Reducing the dichromatic number via cycle reversions in infinite digraphs. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Marcel Abas, Tomás Vetrík Metric dimension of Cayley digraphs of split metacyclic groups. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Artür Manukyan, Elvan Ceyhan Classification using proximity catch digraphs. Search on Bibsonomy Mach. Learn. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Luke Morgan, Joy Morris, Gabriel Verret Digraphs with small automorphism groups that are Cayley on two nonisomorphic groups. Search on Bibsonomy Art Discret. Appl. Math. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Dong Liang, Jie Huang 0001 Leader-following bipartite consensus of multiple uncertain Euler-Lagrange systems over signed switching digraphs. Search on Bibsonomy Neurocomputing The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Laura Pastrana-Ramírez, Rocío Sánchez-López, Miguel Tecpa-Galván Semicomplete absorbent sets in digraphs. Search on Bibsonomy AKCE Int. J. Graphs Comb. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Hortensia Galeana-Sánchez, Rocío Rojas-Monroy, Rocío Sánchez-López Extensions of Richardson's theorem for infinite digraphs and (ℬ)-kernels. Search on Bibsonomy AKCE Int. J. Graphs Comb. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Simon Joyce, Alex Schaefer, Douglas B. West, Thomas Zaslavsky Strongly connectable digraphs and non-transitive dice. Search on Bibsonomy AKCE Int. J. Graphs Comb. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Hortensia Galeana-Sánchez, Miguel Tecpa-Galván -panchromatic digraphs. Search on Bibsonomy AKCE Int. J. Graphs Comb. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12S. Arumugam 0001, Jay S. Bagga Graphoidal graphs and graphoidal digraphs: a generalization of line graphs. Search on Bibsonomy AKCE Int. J. Graphs Comb. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Pilar Cano, Hortensia Galeana-Sánchez, Ilan A. Goldfeder Some results on the existence of Hamiltonian cycles in -compositions of bipartite digraphs. Search on Bibsonomy AKCE Int. J. Graphs Comb. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Alexandr V. Kostochka, Michael Stiebitz The Minimum Number of Edges in 4-Critical Digraphs of Given Order. Search on Bibsonomy Graphs Comb. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Hortensia Galeana-Sánchez, Rocío Sánchez-López Richardson's theorem in quasi-transitive and pre-transitive digraphs. Search on Bibsonomy Graphs Comb. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Pepijn Wissing, Edwin R. van Dam The negative tetrahedron and the first infinite family of connected digraphs that are strongly determined by the Hermitian spectrum. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Ximing Chen, Masaki Ogura 0001, Victor M. Preciado Bounds on the Spectral Radius of Digraphs from Subgraph Counts. Search on Bibsonomy SIAM J. Matrix Anal. Appl. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Maximilian Probst Gutenberg, Christian Wulff-Nilsen Decremental SSSP in Weighted Digraphs: Faster and Against an Adaptive Adversary. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
12Camille Noûs, Kévin Perrot, Sylvain Sené, Lucas Venturini #P-completeness of counting update digraphs, cacti, and a series-parallel decomposition method. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
12Jeff Kinne, Ashwin Murali, Arash Rafiey Digraphs Homomorphism Problems with Maltsev Condition. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
12Maximilian Probst Gutenberg Near-Optimal Algorithms for Reachability, Strongly-Connected Components and Shortest Paths in Partially Dynamic Digraphs. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
12Mikko Koivisto, Antti Röyskö Fast Multi-Subset Transform and Weighted Sums Over Acyclic Digraphs. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
12Zeev Nutov On rooted k-connectivity problems in quasi-bipartite digraphs. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
12Kenjiro Takazawa Notes on Equitable Partition into Matching Forests in Mixed Graphs and into b-branchings in Digraphs. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
12Ly Dinh, Rezvaneh Rezapour, Lan Jiang, Jana Diesner Structural balance in signed digraphs: considering transitivity to measure balance in graphs constructed by using different link signing methods. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
12Aaron Bernstein, Maximilian Probst Gutenberg, Christian Wulff-Nilsen Near-Optimal Decremental SSSP in Dense Weighted Digraphs. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
12Anita Liebenau, Nick Wormald Asymptotic enumeration of digraphs and bipartite graphs by degree sequence. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
12Maciej Duleba, Pawel Gawrychowski, Wojciech Janczewski Efficient Labeling for Reachability in Digraphs. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
12Florent Foucaud, Benjamin Gras 0002, Anthony Perez 0001, Florian Sikora On the complexity of Broadcast Domination and Multipacking in digraphs. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
12Kijung Kim The Italian domination numbers of some products of digraphs. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
12Frank Gurski, Dominique Komander, Marvin Lindemann Efficient computation of the oriented chromatic number of recursively defined digraphs. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
12Kijung Kim The Italian bondage and reinforcement numbers of digraphs. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
12Lukasz Kowalik, Konrad Majewski The Asymmetric Travelling Salesman Problem in Sparse Digraphs. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
12Pierre Aboulker, Pierre Charbit, Reza Naserasr Extension of Gyarfas-Sumner conjecture to digraphs. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
12Frank Gurski, Dominique Komander, Carolin Rehs Acyclic coloring of special digraphs. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
12Catherine Ordun, Sanjay Purushotham, Edward Raff Exploratory Analysis of Covid-19 Tweets using Topic Modeling, UMAP, and DiGraphs. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
12Élie de Panafieu, Sergey Dovgal Counting directed acyclic and elementary digraphs. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
12 Karp's patching algorithm on dense digraphs. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
12Mohamed-Ali Belabbas, Xudong Chen 0002 On Integer Balancing of Digraphs. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
12Florent Foucaud, Shahrzad Heydarshahi, Aline Parreau Domination and location in twin-free digraphs. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Naonori Kakimura, Naoyuki Kamiyama, Kenjiro Takazawa The b-branching problem in digraphs. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Mariusz Grech, Andrzej Kisielewicz 0001 Synchronizing sequences for road colored digraphs. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Julien Bensmail, Kasper Szabo Lyngsie 1-2-3 Conjecture in digraphs: More results and directions. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Kosuke Nakamura, Toru Araki Partitioning vertices into in- and out-dominating sets in digraphs. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Raphael Steiner A note on coloring digraphs of large girth. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Mohammad Hamidi, Reza Ameri α-Derivable digraphs and its application in wireless sensor networking. Search on Bibsonomy Discret. Math. Algorithms Appl. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Weige Xi, Ligong Wang 0001 The Aα spectral radius and maximum outdegree of irregular digraphs. Search on Bibsonomy Discret. Optim. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Diego González-Moreno, Mucuy-kak Guevara, Juan José Montellano-Ballesteros Vertex-monochromatic connectivity of strong digraphs. Search on Bibsonomy Discret. Math. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Dean Crnkovic, Hadi Kharaghani, Andrea Svob Divisible design Cayley digraphs. Search on Bibsonomy Discret. Math. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Kassie Archer, Ira M. Gessel, Christina Graves, Xuming Liang Counting acyclic and strong digraphs by descents. Search on Bibsonomy Discret. Math. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Zejun Huang, Zhenhua Lyu Extremal digraphs avoiding an orientation of C4. Search on Bibsonomy Discret. Math. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
Displaying result #501 - #600 of 2629 (100 per page; Change: )
Pages: [<<][1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license