Existence of -factors in powers of connected graphs
Elena Wisztová (1990)
Časopis pro pěstování matematiky
Similarity:
Elena Wisztová (1990)
Časopis pro pěstování matematiky
Similarity:
Balke, Ludwig, Valverde, Alba (1996)
Beiträge zur Algebra und Geometrie
Similarity:
Ľubomír Šoltés (1990)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
S.F. Forouhandeh, N. Jafari Rad, B.H. Vaqari Motlagh, H.P. Patil, R. Pandiya Raj (2015)
Discussiones Mathematicae Graph Theory
Similarity:
Erratum Identification and corrections of the existing mistakes in the paper On the total graph of Mycielski graphs, central graphs and their covering numbers, Discuss. Math. Graph Theory 33 (2013) 361-371.
Boštjan Brešar, Manoj Changat, Ajitha R. Subhamathi, Aleksandra Tepeh (2010)
Discussiones Mathematicae Graph Theory
Similarity:
The periphery graph of a median graph is the intersection graph of its peripheral subgraphs. We show that every graph without a universal vertex can be realized as the periphery graph of a median graph. We characterize those median graphs whose periphery graph is the join of two graphs and show that they are precisely Cartesian products of median graphs. Path-like median graphs are introduced as the graphs whose periphery graph has independence number 2, and it is proved that there are...
I.B. Lackovic, D.M. Cvetkovic (1976)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
Pavol Híc (1992)
Mathematica Slovaca
Similarity:
Sizhong Zhou, Jiancheng Wu, Tao Zhang (2017)
Discussiones Mathematicae Graph Theory
Similarity:
A spanning subgraph F of a graph G is called a P≥3-factor of G if every component of F is a path of order at least 3. A graph G is called a P≥3-factor covered graph if G has a P≥3-factor including e for any e ∈ E(G). In this paper, we obtain three sufficient conditions for graphs to be P≥3-factor covered graphs. Furthermore, it is shown that the results are sharp.
Finn, Robert, Lu, Jianan (1997)
Memoirs on Differential Equations and Mathematical Physics
Similarity: