A graph-theoretic method for choosing a spanning set for a finite-dimensional vector space, with applications to the Grossman-Larson-Wright module and the Jacobian conjecture.
A graph-theoretical representation of PL-manifolds - A survey on crystallizations.
A Group of Automorphisms of the Rooted Dyadic Tree and Associated Gelfand Pairs
A Hajós type result on factoring finite abelian groups by subsets. II
It is proved that if a finite abelian group is factored into a direct product of lacunary cyclic subsets, then at least one of the factors must be periodic. This result generalizes Hajós's factorization theorem.
A Hamiltonian cycle and a -factor in the fourth power of a graph
A Hamiltonian property of connected sets in the alternative set theory.
A Havel-Hakimi type procedure and a sufficient condition for a sequence to be potentially -graphic
The split graph on vertices is denoted by . A non-increasing sequence of nonnegative integers is said to be potentially -graphic if there exists a realization of containing as a subgraph. In this paper, we obtain a Havel-Hakimi type procedure and a simple sufficient condition for to be potentially -graphic. They are extensions of two theorems due to A. R. Rao (The clique number of a graph with given degree sequence, Graph Theory, Proc. Symp., Calcutta 1976, ISI Lect. Notes Series...
A Hessenberg generalization of the Garsia-Procesi basis for the cohomology ring of Springer varieties.
A high-tech proof of the Mills-Robbins-Rumsey determinant formula.
A Hilton-Milner theorem for vector spaces.
A homeomorphism of Q with Q as an orbit.
A hybrid of Darboux's method and singularity analysis in combinatorial asymptotics.
A -factor containing a given Hamiltonian cycle.
A Kotzig type theorem for non-orientable surfaces
A large dihedral symmetry of the set of alternating sign matrices.
A left weighted Catalan extension.
A lemma and a conjecture on the cost of rearrangements
A linear algorithm for bend-optimal orthogonal drawings of triconnected cubic plane graphs.
A linear algorithm for the two paths problem on permutation graphs
The 'two paths problem' is stated as follows. Given an undirected graph G = (V,E) and vertices s₁,t₁;s₂,t₂, the problem is to determine whether or not G admits two vertex-disjoint paths P₁ and P₂ connecting s₁ with t₁ and s₂ with t₂ respectively. In this paper we give a linear (O(|V|+ |E|)) algorithm to solve the above problem on a permutation graph.
A linear algorithm to recognize maximal generalized outerplanar graphs
In this work, we get a combinatorial characterization for maximal generalized outerplanar graphs (mgo graphs). This result yields a recursive algorithm testing whether a graph is a mgo graph or not.