Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/extensions-on-2-edge-connected-3-regular-up-embeddable-graphs-RFDktqu6Ap
References (8)
-
E. Lloyd, J. Bondy, U. Murty (1978)
Graph Theory with Applications -
Yanpei Liu (1996)
Embeddability in Graphs -
E. Nordhaus, B. Stewart, A. White (1971)
On the maximum genus of a graphJournal of Combinatorial Theory, Series B, 11
-
L. Nebeský (1981)
A new characterization of the maximum genus of a graphCzechoslovak Mathematical Journal, 31
-
M. Škoviera, S. Nedela (1990)
The Maximum Genus of a Graph and Doubly Eulerian TrainsBolletion U. M. I., 4B
-
N. Xuong (1979)
How to determine the maximum genus of a graphJ. Comb. Theory, Ser. B, 26
-
C. Payan, N. Xuong (1979)
Upper embeddability and connectivity of graphsDiscret. Math., 27
-
Y. Liu (1979)
THE MAXIMUM ORIENTABLE GENUS OF A GRAPH
- Publisher
- Springer Journals
- Copyright
- Copyright © 1998 by Science Press
- Subject
- Mathematics; Applications of Mathematics; Math Applications in Computer Science; Theoretical, Mathematical and Computational Physics
- ISSN
- 0168-9673
- eISSN
- 1618-3932
- DOI
- 10.1007/BF02683816
- Publisher site
- See Article on Publisher Site
Abstract
It is known(5) that an investigation of the up-embeddability of the 3-regular graphs shows a useful approach to that of the general graph. But as far, very few characterizations of the up-embeddability are known on the 3-regular graphs. LetG be a 2-edge connected 3-regular graph. We prove thatG is up-embeddable if and only ifG can be obtained from the graphs ϑ, $$\widetilde\theta $$ orK 4 by a series ofM- orN-extensions. Meanwhile, we also present a new structural characterization of such graphG provided thatG is up-embeddable.
Journal
Acta Mathematicae Applicatae Sinica – Springer Journals
Published: Jul 4, 2007