Results 11 to 20 of about 16,341,714 (282)
On k-factor-critical graphs [PDF]
Discussiones Mathematicae Graph Theory, 1996 Summary: A graph is said to be \(k\)-factor-critical if the removal of any set of \(k\) vertices results in a graph with a perfect matching. We study some properties of \(k\)-factor-critical graphs and show that many results on \(q\)-extendable graphs can be improved using this concept.
Favaron, Odile
openaire +4 more sources
The planted k-factor problem [PDF]
Journal of Physics A: Mathematical and Theoretical, 2021 Abstract We consider the problem of recovering an unknown k-factor, hidden in a weighted random graph. For k = 1 this is the planted matching problem, while the k = 2 case is closely related to the planted traveling salesman problem.
Sicuro G., Zdeborova L.
openaire +4 more sources
, 1995 Map shows the Erodeability potential (K factors) for the soil in the Great Swamp Hydrologic Unit Area.
openaire +2 more sources
A constant-factor approximation algorithm for reconciliation k-median [PDF]
, 2023 In the reconciliation k-median problem we ask to cluster a set of data points by picking k cluster centers so as to minimize the sum of distances of the data points to their cluster centers plus the sum of pairwise distances between the centers.
Riegel, B. +4 more
core +4 more sources
The at-most $k$-deep factor tree [PDF]
, 2004 We present a new data structure to index strings that is very similar to a suffix tree. The new structure indexes the factors of a string whose length does not exceed k, and only those.
Allali, Julien, Sagot, Marie-France
core +4 more sources
Factor loadings of the higher-order K-Factor.
, 2022 Factor loadings of the higher-order K-Factor.
Mateo Peñaherrera-Aguirre (5024447) +4 more
core +1 more source
Connected k-factors in bipartite graphs
Discrete Mathematics, 2023 Let $k,l$ be two positive integers. An $S_{k,l}$ is a graph obtained from disjoint $K_{1,k}$ and $K_{1,l}$ by adding an edge between the $k$-degree vertex in $K_{1,k}$ and the $l$-degree vertex in $K_{1,l}$. An {\em $S_{k,l}$-free} graph is a graph containing no induced subgraph isomorphic to $S_{k,l}$.
Yandong Bai, Binlong Li
openaire +4 more sources
On unique k-factors and unique [1,k]-factors in graphs
Discrete Mathematics, 2004 Let \(G\) be a graph and let \(a\) and \(b\), \(a\leq b\), be two positive integers. A spanning subgraph \(F\) of \(G\) is an \([a,b]\)-factor if \(a\leq \deg_Fv\leq b\), for every vertex \(v\) in \(G\). A \([k,k]\)-factor is called a \(k\)-factor. An \([a,b]\)-factor is perfect if each of its components is a regular graph.
Arne Hoffmann, Lutz Volkmann
openaire +3 more sources
Degree Sequences and the Existence of k-Factors [PDF]
Graphs and Combinatorics, 2011 19 ...
Douglas Bauer +4 more
openaire +2 more sources
Amalgamations of connected k-factorizations
Journal of Combinatorial Theory, Series B, 2003 Let \(G\) be an edge-colored graph on the set of colors \(\{ 1,2,\ldots,n\}\), and let \(P\) be a partition of \(V(G)\). The \(P\)-amalgamation of \(G\) is the \(n\)-edge-colored graph with vertex set \(P\), in which \(p\in P\) is incident with \(y\) loops colored \(i\) if and only if there are \(y\) loops or edges in \(G\) that join vertices in \(p\),
Anthony J. W. Hilton +3 more
openaire +3 more sources