A Characterization in of Upper-Embeddable Graphs
From MaRDI portal
Cited in
(50)- The genus of the balanced hypercube
- The maximum genus of graphs of diameter two
- A tight lower bound on the maximum genus of a 3-connected loopless multigraph
- Upper bounds on the bondage number of a graph
- Up-embeddability of graphs with small order
- A tight lower bound on the maximum genus of 3-edge connected loopless graphs
- scientific article; zbMATH DE number 495474 (Why is no real title available?)
- A note on disjoint cycles
- A note on upper embeddable graphs
- Upper embeddability of graphs and products of transpositions associated with edges
- The maximum genus of graph bundles
- On the upper embedding of Steiner triple systems and Latin squares
- Maximum genus, girth and connectivity
- Characterization of the maximum genus of a signed graph
- Maximum genus and connectivity
- Maximum genus and chromatic number of graphs
- scientific article; zbMATH DE number 846937 (Why is no real title available?)
- The maximum genus, matchings and the cycle space of a graph
- Up-embeddability of a graph by order and girth
- scientific article; zbMATH DE number 2230287 (Why is no real title available?)
- scientific article; zbMATH DE number 2230288 (Why is no real title available?)
- On rooted packings, decompositions, and factors of graphs
- The maximum genus of vertex-transitive graphs
- On 2-cell embeddings of graphs with minimum numbers of regions
- Upper bounds for domination related parameters in graphs on surfaces
- On the lower bounds for the maximum genus for simple graphs
- Upper-embeddability and the decycling number of connected 4-regular graphs
- scientific article; zbMATH DE number 907923 (Why is no real title available?)
- Lower bounds on the maximum genus of loopless multigraphs
- Triangular embeddings of \(K_n-K_m\) with unboundedly large \(m\)
- Upper embeddability, girth and the degree-sum of nonadjacent vertices
- Upper embeddability, edge independence number and girth
- A new characterization of the maximum genus of a graph
- The maximum genus of a 3-regular simplicial graph
- An orientation theorem with parity conditions
- Graphs in surfaces and topological ergodicity
- Maximum genus of regular graphs
- Maximum genus and girth of graphs
- On the upper embedding of symmetric configurations with block size 3
- Bi-eulerian embeddings of graphs and digraphs
- scientific article; zbMATH DE number 3933119 (Why is no real title available?)
- Face size and the maximum genus of a graph. I: Simple graphs
- N₂-locally connected graphs and their upper embeddability
- On locally quasiconnected graphs and their upper embeddability
- Polynomial cases of graph decomposition: A complete solution of Holyer's problem
- A tight lower bound on the maximum genus of a simplicial graph
- Local properties and upper embeddability of connected multigraphs
- A note on the maximum genus of 3-edge-connected nonsimple graphs
- On the number of maximum genus embeddings of almost all graphs
- Up-embeddability of graphs with new degree-sum
This page was built for publication: A Characterization in of Upper-Embeddable Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4159393)