Non-separating cycles and discrete Jordan curves

DOI10.1016/0095-8956(92)90072-6zbMath0701.05032OpenAlexW2018359102MaRDI QIDQ913818

Xingxing Yu

Publication date: 1992

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(92)90072-6

zbMATH Keywords

induced subgraph2-connected graphscontractible edge3-connected graphsdiscrete Jordan curvesinduced cyclesnon-separating cycles

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40)

Related Items

Non-contractible edges in a 3-connected graph, Nonseparating Cycles Avoiding Specific Vertices, Chromatic number, induced cycles, and non-separating cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Discrete Jordan curve theorems
• Contractible edges in 3-connected graphs
• Flows and generalized coloring theorems in graphs
• Planarity and duality of finite and infinite graphs
• Non-separating induced cycles in graphs
• Covering contractible edges in 3‐connected graphs. II. Characterizing those with covers of size three
• How to Draw a Graph