Results 41 to 50 of about 778 (78)
A polynomial-time approximation algorithm for the number of k-matchings in bipartite graphs [PDF]
, 2006 We show that the number of $k$-matching in a given undirected graph $G$ is equal to the number of perfect matching of the corresponding graph $G_k$ on an even number of vertices divided by a suitable factor.
Friedland, Shmuel, Levy, Daniel
core +1 more source
Independence Number, Connectivity and All Fractional (a, b, k)-Critical Graphs
Discussiones Mathematicae Graph Theory, 2019 Let G be a graph and a, b and k be nonnegative integers with 1 ≤ a ≤ b. A graph G is defined as all fractional (a, b, k)-critical if after deleting any k vertices of G, the remaining graph has all fractional [a, b]-factors.
Yuan Yuan, Hao Rong-Xia
doaj +1 more source
On the Isometric Path Partition Problem
Discussiones Mathematicae Graph Theory, 2021 The isometric path cover (partition) problem of a graph consists of finding a minimum set of isometric paths which cover (partition) the vertex set of the graph.
Manuel Paul
doaj +1 more source
The Cartesian product of graphs with loops [PDF]
, 2014 We extend the definition of the Cartesian product to graphs with loops and show that the Sabidussi-Vizing unique factorization theorem for connected finite simple graphs still holds in this context for all connected finite graphs with at least one ...
Christiaan E. Van De Woestijne +7 more
core
Gregarious Kite Factorization of Tensor Product of Complete Graphs
Discussiones Mathematicae Graph Theory, 2020 A kite factorization of a multipartite graph is said to be gregarious if every kite in the factorization has all its vertices in different partite sets. In this paper, we show that there exists a gregarious kite factorization of Km × Kn if and only if mn
Tamil Elakkiya A., Muthusamy A.
doaj +1 more source
Arbitrarily Partitionable {2K2, C4}-Free Graphs
Discussiones Mathematicae Graph Theory, 2022 A graph G = (V, E) of order n is said to be arbitrarily partitionable if for each sequence λ = (λ1, λ2, …, λp) of positive integers with λ1 +·…·+λp = n, there exists a partition (V1, V2, …, Vp) of the vertex set V such that Vi induces a connected ...
Liu Fengxia +2 more
doaj +1 more source
Cyclic Matching Sequencibility of Graphs [PDF]
, 2011 We define the cyclic matching sequencibility of a graph to be the largest integer $d$ such that there exists a cyclic ordering of its edges so that every $d$ consecutive edges in the cyclic ordering form a matching.
Brualdi, Richard A. +3 more
core +3 more sources
A Note on Near-factor-critical Graphs [PDF]
, 2014 A near-factor of a finite simple graph $G$ is a matching that saturates all vertices except one. A graph $G$ is said to be near-factor-critical if the deletion of any vertex from $G$ results in a subgraph that has a near-factor. We prove that a connected
Huang, Kuo-Ching, Lih, Ko-Wei
core
Strong Tutte Type Conditions and Factors of Graphs
Discussiones Mathematicae Graph Theory, 2020 Let odd(G) denote the number of odd components of a graph G and k ≥ 2 be an integer. We give sufficient conditions using odd(G − S) for a graph G to have an even factor.
Yan Zheng, Kano Mikio
doaj +1 more source
The Spectrum Problem for the Connected Cubic Graphs of Order 10
Discussiones Mathematicae Graph Theory, 2021 We show that if G is a connected cubic graph of order 10, then there exists a G-decomposition of Kv if and only if v ≣ 1 or 10 (mod 15) except when v = 10 and G is one of 5 specific graphs.
Adams Peter +3 more
doaj +1 more source