Moore: Some theorems on graphs and posets , Discrete Math. 15 (1976), 79–84.William T. Trotter, Jr. and John I. Moore, Jr. Some theorems on graphs and posets. Discrete Math., 15(1):79-84, 1976.Trotter, W. T. and Moore, J. I. (1976) Some theorems on graphs and posets, ...
[8] studied the structure of ISK4-free graphs and obtained several decomposition theorems. Since no ISK4-free graphs whose chromatic number are 5 or more are known, they proposed the following conjecture. Conjecture 1.1 Lévêque et al. [8] If G is an ISK4-free graph, then χ(G)≤4....
Given a fixed integer $n$, we prove Ramsey-type theorems for the classes of all finite ordered $n$-colorable graphs, finite $n$-colorable graphs, finite ordered $n$-chromatic graphs, and finite $n$-chromatic graphs.doi:10.48550/arXiv.0908.0475L. Nguyen Van Thé...
Dynamic Erdős-Rényi Graphs Chapter © 2019 Two folk theorems in topological dynamics Article 11 February 2016 Dynamics of Nonlinear Random Walks on Complex Networks Article 01 December 2018 References S. J. Agronsky, A. M. Bruckner, J. G. Ceder and T. L. Pearson, The structure ...
for results on models that build upon a similar structure. the first statement we get, which sums up theorems 2.13 and 2.14 , is the following. theorem there exists \(t^* > 0\) such that if \(t \le t^*\) then for any \(n \in \mathbb {n}\cup \{\infty \}\) there exists...
Vertex-minors of graphs: A survey and recent theorems and conjectures on vertex-minors and related concepts such as circle graphs, cut-rank functions, rank-width, and interlace polynomials... D Kim,SI Oum - 《Discrete Applied Mathematics》 被引量: 0发表: 2024年 加载更多研究...
Abstract Making use of the familiar convolution structure of analytic functions, we introduce a general class of multivalently analytic functions and derive various useful properties and characteristics of this function class by using the techniques of differential subordination. Several other results are ...
Abstract We investigate the regularity of extremal solutions to some p-Laplacian Dirichlet problems with strong nonlinearities. Under adequate assumptions we prove the smoothness of the extremal solutions for some classes of nonlinearities. Our results suggest that the extremal solution’s boundedness for ...
Abstract We give complete information about the distance, distance Laplacian and distance signless Laplacian characteristic polynomials of graphs obtained by a generalized join graph operation on families of graphs. As an application of these results, we construct many pairs of nonisomorphic distance, ...
Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York (1980) Google Scholar 33 M. Farber, R.E. Jamison On local convexity in graphs Discrete Math., 66 (1987), pp. 231-247 View PDFView articleView in ScopusGoogle Scholar 34 J.R. Isbell Six theorems about injective metric...