Results 21 to 30 of about 131 (107)
Graphs that are Critical for the Packing Chromatic Number
Discussiones Mathematicae Graph Theory, 2022 Given a graph G, a coloring c : V (G) → {1, …, k} such that c(u) = c(v) = i implies that vertices u and v are at distance greater than i, is called a packing coloring of G.
Brešar Boštjan, Ferme Jasmina
doaj +1 more source
Mathematics Subject Classification interrater agreement dataset
, 2022 The Mathematics Subject Classification organizes Publications, Software, and Research Data into a hierarchical classification scheme maintained by MathSciNet (mr) and zbMATH Open (zbmath). According to the classification scheme, both organizations mr and
Olaf Teschke +2 more
core +1 more source
The Existence of Path-Factor Covered Graphs
Discussiones Mathematicae Graph Theory, 2023 A spanning subgraph H of a graph G is called a P≥k-factor of G if every component of H is isomorphic to a path of order at least k, where k ≥ 2. A graph G is called a P≥k-factor covered graph if there is a P≥k-factor of G covering e for any e ∈ E(G).
Dai Guowei
doaj +1 more source
Equimatchable Bipartite Graphs
Discussiones Mathematicae Graph Theory, 2023 A graph is called equimatchable if all of its maximal matchings have the same size. Lesk et al. [Equi-matchable graphs, Graph Theory and Combinatorics (Academic Press, London, 1984) 239–254] has provided a characterization of equimatchable bipartite ...
Büyükçolak Yasemin +2 more
doaj +1 more source
Turán Function and H-Decomposition Problem for Gem Graphs
Discussiones Mathematicae Graph Theory, 2018 Given a graph H, the Turán function ex(n,H) is the maximum number of edges in a graph on n vertices not containing H as a subgraph. For two graphs G and H, an H-decomposition of G is a partition of the edge set of G such that each part is either a single
Liu Henry, Sousa Teresa
doaj +1 more source
Further new results on strong resolving partitions for graphs
Open Mathematics, 2020 A set W of vertices of a connected graph G strongly resolves two different vertices x, y ∉ W if either d G(x, W) = d G(x, y) + d G(y, W) or d G(y, W) = d G(y, x) + d
Kuziak Dorota, Yero Ismael G.
doaj +1 more source
Some Results on Path-Factor Critical Avoidable Graphs
Discussiones Mathematicae Graph Theory, 2023 A path factor is a spanning subgraph F of G such that every component of F is a path with at least two vertices. We write P≥k = {Pi : i ≥ k}. Then a P≥k-factor of G means a path factor in which every component admits at least k vertices, where k ≥ 2 is ...
Zhou Sizhong
doaj +1 more source
Three matching intersection property for matching covered graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 In connection with Fulkerson's conjecture on cycle covers, Fan and Raspaud proposed a weaker conjecture: For every bridgeless cubic graph $G$, there are three perfect matchings $M_1$, $M_2$, and $M_3$ such that $M_1\cap M_2 \cap M_3=\emptyset$.
Hao Lin, Xiumei Wang
doaj +1 more source
The matching polynomial of a distance‐regular graph
International Journal of Mathematics and Mathematical Sciences, Volume 23, Issue 2, Page 89-97, 2000., 2000 A distance‐regular graph of diameter d has 2d intersection numbers that determine many properties of graph (e.g., its spectrum). We show that the first six coefficients of the matching polynomial of a distance‐regular graph can also be determined from its intersection array, and that this is the maximum number of coefficients so determined.
Robert A. Beezer, E. J. Farrell
wiley +1 more source
Decompositions of Cubic Traceable Graphs
Discussiones Mathematicae Graph Theory, 2020 A traceable graph is a graph with a Hamilton path. The 3-Decomposition Conjecture states that every connected cubic graph can be decomposed into a spanning tree, a 2-regular graph and a matching. We prove the conjecture for cubic traceable graphs.
Liu Wenzhong, Li Panpan
doaj +1 more source