Maximum genus and maximum nonseparating independent set of a 3-regular graph

DOI10.1016/S0012-365X(96)00299-3zbMath0888.05020OpenAlexW1975388763MaRDI QIDQ1377685

Yuangqiu Huang, Yanpei Liu

Publication date: 26 January 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00299-3

zbMATH Keywords

maximum genusnonseparating independent set

Mathematics Subject Classification ID

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

Related Items (8)

A \(9k\) kernel for nonseparating independent set in planar graphs ⋮ Maximum genus and chromatic number of graphs ⋮ A sufficient condition on upper embeddability of graphs ⋮ The maximum genus of a 3-regular simplicial graph ⋮ Nonseparating independent sets of Cartesian product graphs ⋮ Maximum genus, girth and connectivity ⋮ Maximum genus and girth of graphs ⋮ Maximum genus, connectivity and minimal degree of graphs

Cites Work

• On the maximum induced forests of a connected cubic graph without triangles
• Induced forests in cubic graphs
• On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three
• Extensions on 2-edge connected 3-regular up-embeddable graphs
• On the maximum genus of a graph
• On feedback vertex sets and nonseparating independent sets in cubic graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Maximum genus and maximum nonseparating independent set of a 3-regular graph