Extremal problems for directed graphs. J. Combinatorial Theory Ser. B, 15:77-93, 1973.W. G. Brown, P. Erd}os, M. Simonovits, Extremal problems for directed graphs, Journal of Combinatorial Theory B15 (1973), 77-93.W. G. BROWN, P. ERDO˝ S, AND M. SIMONOVITS: Extremal ...
Simonovits: Extremal problems for directed graphs, Journal of Combinatorial Theory, B 15(1) (1973) 77–93. Article MATH Google Scholar W. G. Brown, P. Erdős and M. Simonovits: On multigraph extremal problems, Problèmes Combin. et Theorie des graphes, (ed. J. Bermond et al.), ...
Extremal problems for directed graphs Considers directed graphs without loops and multiple edges, where the exclusion of multiple edges means that two vertices cannot be joined by two edges of ... WG Brown,P Erd?S,M Simonovits - 《Journal of Combinatorial Theory》 被引量: 79发表: 1973年 Ex...
These extremal problems are special cases of the general question of realizability of graph invariants. For example a (p, Δ, δ, λ) graph is a graph having p-points, maximum degree Δ, minimum degree δ, and line-connectivity λ. An arbitrary quadruple of integers......
1.4Othertypesofextremalgraphproblems...8 1.5Historicalremarks...9 2Thegeneraltheory,classification10 2.1TheimportanceoftheDegenerateCase...11 2.2TheasymmetriccaseofExcludedBipartitegraphs...13 2.3Reductions:Hostgraphs...14 2.4Excludingcompletebipartitegraphs...15 2.5Probabilisticlowerbound...17 2.6Classi...
Mathematics Subject Classification (1991):65M1065M05A third-order accurate Godunov-type scheme for the approximate solution of hyperbolic systems of ... XD Liu,E Tadmor - 《Numerische Mathematik》 被引量: 340发表: 1998年 Stable Multiscale Bases and Local Error Estimation for Elliptic Problems con...
Thomason, On quadrilaterals in layers of the cube and extremal problems for directed and oriented graphs, J Graph Theory 33 (2000), 66-82.R. H. Schelp and A. Thomason, On quadrilaterals in layers of the cube and extremal problems for directed and oriented graphs, J. Graph Theory 33 (...
Size of members of infinite family of directed regular graphs of high girth is close to an upper bound. Finite automata related to members of such a family of algebraic graphs over chosen commutative ring can be used effectively for the design of cryptographical algorithm for different problems ...
On Extremal Graph Theory for Directed Graphs and its Applications to Information SecurityUstimenko
Extremal problems for directed graphs Considers directed graphs without loops and multiple edges, where the exclusion of multiple edges means that two vertices cannot be joined by two edges of ... WG Brown,P Erd?S,M Simonovits - 《Journal of Combinatorial Theory》 被引量: 79发表: 1973年 ...