craven
发表于 2025-3-26 22:40:51
Sufficient Conditions for the Existence of Perfect Heterochromatic Matchings in Colored Graphs,ngs for which the maximum matching problem is solvable in polynomial time, the maximum heterochromatic matching problem is NP-complete. This means that to find both sufficient and necessary good conditions for the existence of perfect heterochromatic matchings should be not easy. In this paper, we o
Exonerate
发表于 2025-3-27 02:23:46
Impossibility of Transformation of Vertex Labeled Simple Graphs Preserving the Cut-Size Order,be equivalent. From the equivalence, . precedes .′ in the order means that there is a sequence of cross-operations transforming . into .′. However, even if both graphs are simple, non-simple graphs may appear on the way of the transformation. If both graphs have the same number of edges, we conjectu
贫困
发表于 2025-3-27 06:59:19
http://reply.papertrans.cn/29/2812/281130/281130_33.png
连锁
发表于 2025-3-27 11:25:39
http://reply.papertrans.cn/29/2812/281130/281130_34.png
手工艺品
发表于 2025-3-27 14:37:44
http://reply.papertrans.cn/29/2812/281130/281130_35.png
漂亮才会豪华
发表于 2025-3-27 21:00:34
http://reply.papertrans.cn/29/2812/281130/281130_36.png
繁忙
发表于 2025-3-28 01:47:45
Isolated Toughness and Existence of ,-Factors,; otherwise, set .(.) = |.(.)| − 1. Let . and . be two nonnegative integer-valued functions defined on .(.) satisfying . ≤ .(.) ≤ .(.) ≤ . . The purpose in this paper are to present sufficient conditions in terms of the isolated toughness and the minimum degree for graphs to have .-factors and (., .
heirloom
发表于 2025-3-28 05:14:38
A Note on the Integrity of Middle Graphs,and .(. − .) denote the the subset of . and the order of the largest component of . − ., respectively. In this paper, we determine the integrity and some other parameters of middle graphs of some classes of graphs.
凶猛
发表于 2025-3-28 06:40:25
Indecomposable Coverings, any fixed concave quadrilateral, that cannot be decomposed into two coverings. We also construct, for every . > 1, a set of points . and a family of disks . in the plane, each containing at least . elements of ., such that no matter how we color the points of . with two colors, there exists a disk
储备
发表于 2025-3-28 14:10:03
The Decycling Number of Cubic Planar Graphs,ted cubic planar graphs of order 2. and ., then there exist integers .. and .. such that there exists a graph . with .(.) = . if and only if . is an integer satisfying .. ≤ . ≤ ... We also find all corresponding integers .. and ... In addition, we prove that if . is the class of all connected cubic