Results 31 to 40 of about 807 (75)
Packing Trees in Complete Bipartite Graphs
Discussiones Mathematicae Graph Theory, 2022 An embedding of a graph H in a graph G is an injection (i.e., a one-to-one function) σ from the vertices of H to the vertices of G such that σ(x)σ(y) is an edge of G for all edges xy of H. The image of H in G under σ is denoted by σ(H).
Wang Jieyan
doaj +1 more source
Fullerene graphs have exponentially many perfect matchings
, 2009 A fullerene graph is a planar cubic 3-connected graph with only pentagonal and hexagonal faces.
D.J. Klein +17 more
core +1 more source
The 2-pebbling property of squares of paths and Graham’s conjecture
Open Mathematics, 2020 A pebbling move on a graph G consists of taking two pebbles off one vertex and placing one pebble on an adjacent vertex. The pebbling number of a connected graph G, denoted by f(G), is the least n such that any distribution of n pebbles on G allows one ...
Li Yueqing, Ye Yongsheng
doaj +1 more source
Fundamental Cycles and Graph Embeddings
, 2008 In this paper we present a new Good Characterization of maximum genus of a graph which makes a common generalization of the works of Xuong, Liu, and Fu et al.
B. Mohar +10 more
core +2 more sources
Discussiones Mathematicae Graph Theory, 2017 We characterize the class L32$L_3^2 $ of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 by means of a finite list of forbidden induced subgraphs in the class of threshold graphs.
Metelsky Yury +2 more
doaj +1 more source
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
Decomposition of the Product of Cycles Based on Degree Partition
Discussiones Mathematicae Graph Theory, 2019 The Cartesian product of n cycles is a 2n-regular, 2n-connected and bi- pancyclic graph. Let G be the Cartesian product of n even cycles and let 2n = n1+ n2+ ・ ・ ・ + nkwith k ≥ 2 and ni≥ 2 for each i. We prove that if k = 2, then G can be decomposed into
Borse Y. M., Shaikh S. R.
doaj +1 more source
A note on the partition dimension of Cartesian product graphs
, 2010 Let $G=(V,E)$ be a connected graph. The distance between two vertices $u,v\in V$, denoted by $d(u, v)$, is the length of a shortest $u-v$ path in $G$. The distance between a vertex $v\in V$ and a subset $P\subset V$ is defined as $min\{d(v, x): x \in P\}$
Rodriquez-Velazquez, Juan A. +1 more
core +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
Decomposing 10-Regular Graphs into Paths of Length 5
Discussiones Mathematicae Graph Theory, 2022 Let G be a 10-regular graph which does not contain any 4-cycles. In this paper, we prove that G can be decomposed into paths of length 5, such that every vertex is a terminal of exactly two paths.
Xie Mengmeng, Zhou Chuixiang
doaj +1 more source