Families of triples with high minimum degree are hamiltonian
In this paper we show that every family of triples, that is, a 3-uniform hypergraph, with minimum degree at least [...] contains a tight Hamiltonian cycle
Fans and bundles in the graph of pairwise sums and products.
Fast approximation of centrality.
Fast Fourier analysis for over a finite field and related numerical experiments.
Faster algorithms for Frobenius numbers.
Faster backtracking algorithms for the generation of symmetry-invariant permutations.
Fatgraph models of RNA structure
In this review paper we discuss fatgraphs as a conceptual framework for RNA structures. We discuss various notions of coarse-grained RNA structures and relate them to fatgraphs.We motivate and discuss the main intuition behind the fatgraph model and showcase its applicability to canonical as well as noncanonical base pairs. Recent discoveries regarding novel recursions of pseudoknotted (pk) configurations as well as their translation into context-free grammars for pk-structures are discussed. This...
Fault Tolerant Detectors for Distinguishing Sets in Graphs
For various domination-related parameters involving locating devices (distinguishing sets) that function as places from which detectors can determine information about the location of an “intruder”, several types of possible detector faults are identified. Two of these fault tolerant detector types for distinguishing sets are considered here, namely redundant distinguishing and detection distinguishing. Illustrating these concepts, we focus primarily on open-locating-dominating sets.
Few colored cuts or cycles in edge colored graphs
Fiedler vectors with unbalanced sign patterns
In spectral bisection, a Fielder vector is used for partitioning a graph into two connected subgraphs according to its sign pattern. We investigate graphs having Fiedler vectors with unbalanced sign patterns such that a partition can result in two connected subgraphs that are distinctly different in size. We present a characterization of graphs having a Fiedler vector with exactly one negative component, and discuss some classes of such graphs. We also establish an analogous result for regular graphs...
Finding a minimum dominating set by transforming domination of vertices.
Finding a Minimum-Weight k-Link Path in Graphs with the Concave Monge Property and Applications.
Finding a spanning tree of a graph with maximal number of terminal vertices
Finding all the best swaps of a minimum diameter spanning tree under transient edge failures.
Finding -partitions efficiently
We study the concept of an -partition of the vertex set of a graph , which includes all vertex partitioning problems into four parts which we require to be nonempty with only external constraints according to the structure of a model graph , with the exception of two cases, one that has already been classified as polynomial, and the other one remains unclassified. In the context of more general vertex-partition problems, the problems addressed in this paper have these properties: non-list, -part,...
Finding H-partitions efficiently
We study the concept of an H-partition of the vertex set of a graph G, which includes all vertex partitioning problems into four parts which we require to be nonempty with only external constraints according to the structure of a model graph H, with the exception of two cases, one that has already been classified as polynomial, and the other one remains unclassified. In the context of more general vertex-partition problems, the problems addressed in this paper have these properties: non-list, 4-part, external...
Finding induced acyclic subgraphs in random digraphs.
Finding Minimal Branchings With a Given Number of Arcs
Finding nonoverlapping substructures of a sparse matrix.
Finding shortest paths with computational geometry.