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

DOI10.1016/S0012-365X(96)00299-3MaRDI QIDQ1377685zbMATH OpenOpenAlexFDO

Authors 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

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

Review text

Let \(G\) be a connected graph with vertex set \(V\). A set \(J\subseteq V\) is called a nonseparating independent set (nsis) if \(J\) is an independent set of \(G\) and \(G-J\) is connected. The nsis number of \(G\), \(z(G)\), is the maximum cardinality that an nsis for \(G\) can attain. The authors show that, for \(G\) a 3-regular connected graph, the maximum genus is equal to \(z(G)\). This is then used to obtain several new results about the maximum genus parameter.

Recommendations

• Nonseparating independent sets and maximum genus of graphs
• Maximum genus and independent set.
• The maximum genus of a 3-regular simplicial graph
• A note on the maximum genus of 3-edge-connected nonsimple graphs

Cites work

• Extensions on 2-edge connected 3-regular up-embeddable graphs
• Graph theory
• scientific article; zbMATH DE number 3972888 (Why is no real title available?)
• scientific article; zbMATH DE number 3750968 (Why is no real title available?)
• scientific article; zbMATH DE number 951476 (Why is no real title available?)
• Induced forests in cubic graphs
• On feedback vertex sets and nonseparating independent sets in cubic graphs
• On the maximum genus of a graph
• On the maximum induced forests of a connected cubic graph without triangles
• On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three

Cited in

(11)

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

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

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