Note on linear arboricity
Pavel Tomasta (1982)
Mathematica Slovaca
Similarity:
Displaying similar documents to “A proof of the two-path conjecture.”
Note on linear arboricity
Degree powers in graphs with a forbidden even cycle.
Nikiforov, Vladimir (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Intersection Graphs of Graphs
Bohdan Zelinka (1975)
Matematický časopis
Similarity:
Paths through fixed vertices in edge-colored graphs
W. S. Chou, Y. Manoussakis, O. Megalakaki, M. Spyratos, Zs. Tuza (1994)
Mathématiques et Sciences Humaines
Similarity:
We study the problem of finding an alternating path having given endpoints and passing through a given set of vertices in edge-colored graphs (a path is alternating if any two consecutive edges are in different colors). In particular, we show that this problem in NP-complete for 2-edge-colored graphs. Then we give a polynomial characterization when we restrict ourselves to 2-edge-colored complete graphs. We also investigate on (s,t)-paths through fixed vertices, i.e. paths of length...
Ramsey -minimal graphs.
Borowiecki, M., Schiermeyer, I., Sidorowicz, E. (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Analoga of Menger's theorem for polar and polarized graphs
Bohdan Zelinka (1976)
Czechoslovak Mathematical Journal
Similarity:
On the graphs with maximum distance or -diameter
Wayne Goddard, Christine S. Swart, Henda C. Swart (2005)
Mathematica Slovaca
Similarity: