Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
1973.
Graphs and Hypergraphs.
Vol. 6,
Issue. ,
p.
498.
Bondy, J. A.
and
Murty, U. S. R.
1976.
Graph Theory with Applications.
p.
171.
Mader, W.
1978.
Advances in Graph Theory.
Vol. 3,
Issue. ,
p.
145.
Mader, W.
1979.
Eine Reduktionsmethode für den Kantenzusammenhang in Graphen.
Mathematische Nachrichten,
Vol. 93,
Issue. 1,
p.
187.
Chaty, G.
and
Chein, M.
1979.
Minimally 2‐edge connected graphs.
Journal of Graph Theory,
Vol. 3,
Issue. 1,
p.
15.
McDiarmid, Colin
1981.
General percolation and random graphs.
Advances in Applied Probability,
Vol. 13,
Issue. 1,
p.
40.
McDiarmid, Colin
1981.
General percolation and random graphs.
Advances in Applied Probability,
Vol. 13,
Issue. 1,
p.
40.
Itai, A.
and
Rodeh, M.
1984.
The Multi-Tree Approach To Reliability In Distributed Networks.
p.
137.
Itai, Alon
and
Zehavi, Avram
1984.
Bounds on path connectivity.
Discrete Mathematics,
Vol. 51,
Issue. 1,
p.
25.
Berge, C.
1984.
Graph Theory Singapore 1983.
Vol. 1073,
Issue. ,
p.
31.
Pouzet, M.
1985.
Graphs and Order.
p.
592.
1986.
Matching Theory.
Vol. 121,
Issue. ,
p.
483.
Chen, Zhi-bo
and
Zhang, Fu-ji
1988.
Bounds of the longest directed cycle length for minimal strong digraphs.
Discrete Mathematics,
Vol. 68,
Issue. 1,
p.
9.
Itai, Alon
and
Rodeh, Michael
1988.
The multi-tree approach to reliability in distributed networks.
Information and Computation,
Vol. 79,
Issue. 1,
p.
43.
THOMASSEN, CARSTEN
1989.
Configurations in Graphs of Large Minimum Degree, Connectivity, or Chromatic Number.
Annals of the New York Academy of Sciences,
Vol. 555,
Issue. 1,
p.
402.
Aharoni, Ron
and
Thomassen, Carsten
1989.
Infinite, highly connected digraphs with no two arc‐disjoint spanning trees.
Journal of Graph Theory,
Vol. 13,
Issue. 1,
p.
71.
Chrobak, Marek
and
Eppstein, David
1991.
Planar orientations with low out-degree and compaction of adjacency matrices.
Theoretical Computer Science,
Vol. 86,
Issue. 2,
p.
243.
Grötschel, M.
Monma, C.L.
and
Stoer, M.
1995.
Network Models.
Vol. 7,
Issue. ,
p.
617.
Bang‐Jensen, Jørgen
1995.
Digraphs with the path‐merging property.
Journal of Graph Theory,
Vol. 20,
Issue. 2,
p.
255.
Frank, András
and
Király, Zoltán
1999.
Integer Programming and Combinatorial Optimization.
Vol. 1610,
Issue. ,
p.
191.