Connected spanning subgraphs of 3-connected planar graphs

DOI10.1006/JCTB.1996.0072MaRDI QIDQ1125960zbMATH OpenOpenAlexFDO

Authors Hikoe Enomoto, Tadashi Iida, Katsuhiro Ota

Publication date 4 May 1997

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

Full work available at URL https://doi.org/10.1006/jctb.1996.0072

zbMATH Keywords

3-connected planar graphconnected factor

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited in

(9)

• Local neighbor-distinguishing index of graphs
• Spanning even subgraphs of 3‐edge‐connected graphs
• \([2,3]\)-factors in a 3-connected infinite planar graph.
• 2-connected spanning subgraphs of planar 3-connected graphs
• Subgraphs with restricted degrees of their vertices in planar 3-connected graphs
• 2-connected spanning subgraphs of circuit graphs
• Minimum degree conditions for the existence of fractional factors in planar graphs
• (3,3)-linked planar graphs
• Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey

This page was built for publication: Connected spanning subgraphs of 3-connected planar graphs

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