Local properties and upper embeddability of connected multigraphs
This paper unifies three known sufficient conditions for a connected multigraph \(G\) to be upper embeddable: (1) \(G\) is a 2-connected multigraph, and each edge of \(G\) belongs to a cycle of length 2 or 3; see \textit{Glakhov} [Preprint 80.8, IM AN USSR, Kiev, 24-27 (1980)]; (2) \(G\) is a connected, locally quasiconnected graph; see the author [Czech. Math. J. 35(110), 162-166 (1985; Zbl 0584.05031)]; (3) \(G\) is a connected, \(N_ 2\)-locally connected graph; see the author [Czech. Math. J. 41(116), No. 4, 731-735 (1991; Zbl 0760.05030)]. Let \(u\) be a vertex in multigraph \(G\); let \(E(u,G)\) denote the set of all edges in \(G\) not incident with \(u\), but incident with a vertex adjacent to \(u\). If \(E(u,G)\neq\varnothing\), let \(N_ 2(u,G)\) denote the submultigraph of \(G\) induced by \(E(u,G)\). Then \(G\) is said to be interlaced if: (i) if no cycle of length 2 or 3 passes through an edge incident with both \(u\) and \(v\), then \(N_ 2(u,G)\) and \(N_ 2(v,G)\) are both connected, for each pair of adjacent vertices \(u\) and \(v\) of \(G\); and (ii) \(N(w,G)\) is connected, for each vertex \(w\) adjacent to a cut-vertex of \(G\). (\(N(w,G)\) is the submultigraph of \(G\) induced by the neighbors of \(u\), if that neighborhood is nonempty.) Then the common generalization of the three theorems arising from (1), (2), (3) above is: Let \(G\) be a connected multigraph, with \(W\) a nonempty subset of \(V(G)\) such that the submultigraph of \(G\) induced by \(W\) is connected and interlaced, and either \(W= V(G)\) or \(G-W\) is a forest. Then \(G\) is upper embeddable.
- N₂-locally connected graphs and their upper embeddability
- On locally quasiconnected graphs and their upper embeddability
- scientific article; zbMATH DE number 1559169
- scientific article; zbMATH DE number 5260312
- Locally connectivity and up-embeddability of a graph
- On pancyclic claw-free graphs
- On paths and cycles through specified vertices
- Publication:4864765
- Publication:4732495
- A note on the neighbor condition for up-embeddability of graphs.
- N₂-locally connected graphs and their upper embeddability
- A Characterization in of Upper-Embeddable Graphs
- A new characterization of the maximum genus of a graph
- How to determine the maximum genus of a graph
- scientific article; zbMATH DE number 4156462 (Why is no real title available?)
- scientific article; zbMATH DE number 4004226 (Why is no real title available?)
- scientific article; zbMATH DE number 3625415 (Why is no real title available?)
- scientific article; zbMATH DE number 3422404 (Why is no real title available?)
- Locally connected graphs
- On locally quasiconnected graphs and their upper embeddability
- A local intersection condition for n-extendable graphs
- Locally connectivity and up-embeddability of a graph
- On locally quasiconnected graphs and their upper embeddability
- N₂-locally connected graphs and their upper embeddability
- scientific article; zbMATH DE number 846937 (Why is no real title available?)
- Two local and one global properties of 3-connected graphs on compact 2-dimensional manifolds
This page was built for publication: Local properties and upper embeddability of connected multigraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4276520)