Graph ear decompositions and graph embeddings
DOI10.1007/3-540-57899-4_67zbMATH Open1530.05148MaRDI QIDQ6184633FDOQ6184633
Authors: Jianer Chen, Saroja P. Kanchi 
Publication date: 5 January 2024
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Recommendations
- Graph Ear Decompositions and Graph Embeddings
- scientific article; zbMATH DE number 51713
- Embeddings of graphs
- scientific article; zbMATH DE number 1342146
- Algorithms – ESA 2004
- scientific article; zbMATH DE number 4164896
- Algorithmic graph embeddings
- Embedding graphs into embedded graphs
- Embedding Graphs into Embedded Graphs
Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Improved algorithms for graph four-connectivity
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Finding Lowest Common Ancestors: Simplification and Parallelization
- Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
- How to determine the maximum genus of a graph
- A classification of 4-connected graphs
- Overlap matrices and total imbedding distributions
- On the maximum genus of a graph
- Limit points for average genus. I: 3-connected and 2-connected simplicial graphs
- Title not available (Why is that?)
- Survey of results on the maximum genus of a graph
- Kuratowski-type theorems for average genus
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (2)
This page was built for publication: Graph ear decompositions and graph embeddings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6184633)
