On the structure of -connected graphs.
Karpov, D.V., Pastor, A.V. (2000)
Zapiski Nauchnykh Seminarov POMI
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Karpov, D.V., Pastor, A.V. (2000)
Zapiski Nauchnykh Seminarov POMI
Similarity:
Víctor Neumann-Lara, Eduardo Rivera-Campo, Jorge Urrutia (2004)
Discussiones Mathematicae Graph Theory
Similarity:
If G is a minimally 3-connected graph and C is a double cover of the set of edges of G by irreducible walks, then |E(G)| ≥ 2| C| - 2.
Ladislav Nebeský (1991)
Czechoslovak Mathematical Journal
Similarity:
Ladislav Nebeský (2001)
Mathematica Bohemica
Similarity:
The interval function (in the sense of H. M. Mulder) is an important tool for studying those properties of a connected graph that depend on the distance between vertices. An axiomatic characterization of the interval function of a connected graph was published by Nebeský in 1994. In Section 2 of the present paper, a simpler and shorter proof of that characterization will be given. In Section 3, a characterization of geodetic graphs will be established; this characterization will utilize...
Ladislav Nebeský (1990)
Časopis pro pěstování matematiky
Similarity:
Gabor Bacsó, Zsolt Tuza (2004)
Discussiones Mathematicae Graph Theory
Similarity:
Zverovich [Discuss. Math. Graph Theory 23 (2003), 159-162.] has proved that the domination number and connected domination number are equal on all connected graphs without induced P₅ and C₅. Here we show (with an independent proof) that the following stronger result is also valid: Every P₅-free and C₅-free connected graph contains a minimum-size dominating set that induces a complete subgraph.
David Phillips (1972)
Fundamenta Mathematicae
Similarity:
Jiří Jelínek (2003)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity: