The maximum genus of a 3-regular simplicial graph

DOI10.1007/S11766-999-0027-9MaRDI QIDQ1807872zbMATH OpenOpenAlexFDO

Authors Deming Li, Yanpei Liu

Publication date 8 October 2000

Published in Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11766-999-0027-9

zbMATH Keywords

independent numbermaximum genus

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• Maximum genus and maximum nonseparating independent set of a 3-regular graph
• Maximum genus and connectivity
• Maximum genus and independent set.
• A tight lower bound on the maximum genus of a simplicial graph

Cites work

• scientific article; zbMATH DE number 951476 (Why is no real title available?)
• A Characterization in of Upper-Embeddable Graphs
• A tight lower bound on the maximum genus of a simplicial graph
• Bounds of the number of disjoint spanning trees
• How to determine the maximum genus of a graph
• Induced forests in cubic graphs
• Lower Bounds For Induced Forests in Cubic Graphs
• Maximum genus and connectivity
• Maximum genus and maximum nonseparating independent set of a 3-regular graph
• On feedback vertex sets and nonseparating independent sets in cubic graphs
• Upper-embeddable graphs and related topics

Cited in

(4)

• scientific article; zbMATH DE number 969182 (Why is no real title available?)
• scientific article; zbMATH DE number 6424523 (Why is no real title available?)
• Nonseparating independent sets and maximum genus of graphs
• Maximum genus and independent set.

This page was built for publication: The maximum genus of a 3-regular simplicial graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1807872)