Odd components of co-trees and graph embeddings

DOI10.1016/j.amc.2016.04.027zbMath1410.05151OpenAlexW2346036367MaRDI QIDQ1733528

Han Ren, Fugang Chao

Publication date: 21 March 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2016.04.027

zbMATH Keywords

spanning treegraph embeddingsodd component of co-trees

Mathematics Subject Classification ID

Trees (05C05) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• Extremality of degree-based graph entropies
• The classification of Hamiltonian generalized Petersen graphs
• How to determine the maximum genus of a graph
• A Nebeský-type characterization for relative maximum genus
• Strong Traces Model of Self-Assembly Polypeptide Structures
• On a conjecture about tricyclic graphs with maximal energy
• The Genus, Regional Number, and Betti Number of a Graph

This page was built for publication: Odd components of co-trees and graph embeddings