Amanote Research

Amanote Research

    RegisterSign In

On the Optimality of 3-Restricted Arc Connectivity for Digraphs and Bipartite Digraphs

Discussiones Mathematicae - Graph Theory - Poland
doi 10.7151/dmgt.2259
Full Text
Open PDF
Abstract

Available in full text

Categories
CombinatoricsApplied MathematicsDiscrete Mathematics
Date

January 1, 2019

Authors
Jixiang MengYaoyao Zhang
Publisher

Faculty of Mathematics, Computer Science and Econometrics, University of Zielona Gora


Related search

Constructions for Arc-Transitive Digraphs

Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics
1995English

A Proof for Berges Dual Conjecture for Bipartite Digraphs

2019English

Super Connectivity of Line Graphs and Digraphs

Acta Mathematicae Applicatae Sinica
Applied Mathematics
2006English

Minimally Strong Subgraph (K,l)-Arc-Connected Digraphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2020English

On Highly Regular Digraphs

English

Arc Crossing Minimization in Hierarchical Digraphs With Tabu Search

Computers and Operations Research
Management ScienceSimulationComputer ScienceOperations ResearchModeling
1997English

On Bounds for the Energy of Graphs and Digraphs

Contemporary Mathematics
Mathematics
2018English

Antimagic Labeling of Digraphs

Journal of the Indonesian Mathematical Society
2016English

Voting Paradoxes and Digraphs Realizations

Advances in Applied Mathematics
Applied Mathematics
2002English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy