Upper embeddable factorizations of graphs
Let G be a graph (possibly with multiple edges and loops). A sequence \((G_ 1,\ldots,G_ n)\), where \(n\geq 1\), is referred to as an upper embeddable n-factorization of G if \(G_ 1,\ldots,G_ n\) are upper embeddable spanning subgraphs of G, and each edge of G belongs to exactly one of the graphs \(G_ 1,\ldots,G_ n\). The paper gives a necessary and sufficient condition for a graph to have an upper embeddable n- factorization (Theorem 2). The proof is partially based on a generalization of methods used by the author in his paper on the maximum genus of a graph [ibid. 31(106), 604-613 (1981; Zbl 0482.05034)].
- A Characterization in of Upper-Embeddable Graphs
- A new characterization of the maximum genus of a graph
- Edge-Disjoint Spanning Trees of Finite Graphs
- How to determine the maximum genus of a graph
- scientific article; zbMATH DE number 3625415 (Why is no real title available?)
- scientific article; zbMATH DE number 3422404 (Why is no real title available?)
- On the Problem of Decomposing a Graph into n Connected Factors
This page was built for publication: Upper embeddable factorizations of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3708051)