Graph ear decompositions and graph embeddings

DOI10.1007/3-540-57899-4_67zbMath1530.05148MaRDI QIDQ6184633

Saroja P. Kanchi, Jian'er Chen

Publication date: 5 January 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

zbMATH Keywords

polynomial time algorithmmaximum-paired ear decomposition of a graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved algorithms for graph four-connectivity
• Limit points for average genus. I: 3-connected and 2-connected simplicial graphs
• Kuratowski-type theorems for average genus
• A classification of 4-connected graphs
• How to determine the maximum genus of a graph
• Overlap matrices and total imbedding distributions
• On the maximum genus of a graph
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
• Survey of results on the maximum genus of a graph

This page was built for publication: Graph ear decompositions and graph embeddings