Graph ear decompositions and graph embeddings

DOI10.1007/3-540-57899-4_67MaRDI QIDQ6184633zbMATH OpenFDO

Authors Jianer Chen, Saroja P. Kanchi

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

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)

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

Cites work

• scientific article; zbMATH DE number 3904590 (Why is no real title available?)
• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• scientific article; zbMATH DE number 4006288 (Why is no real title available?)
• scientific article; zbMATH DE number 512923 (Why is no real title available?)
• scientific article; zbMATH DE number 512928 (Why is no real title available?)
• A classification of 4-connected graphs
• Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
• How to determine the maximum genus of a graph
• Improved algorithms for graph four-connectivity
• Kuratowski-type theorems for average genus
• Limit points for average genus. I: 3-connected and 2-connected simplicial graphs
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• On the maximum genus of a graph
• Overlap matrices and total imbedding distributions
• Survey of results on the maximum genus of a graph

Cited in

(2)

• Ear decomposition for pair comparison data
• Graph Ear Decompositions and Graph Embeddings

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)