Odd induced subgraphs in planar graphs with large girth

DOI10.1007/S00373-022-02499-7MaRDI QIDQ2672043zbMATH OpenOpenAlexFDO

Authors Mengjiao Rao, Qinghou Zeng, Jianfeng Hou

Publication date 8 June 2022

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-022-02499-7

zbMATH Keywords

induced subgraphgirthplanar graphodd graph

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07)

Recommendations

• Odd induced subgraphs in graphs with treewidth at most two
• Every graph contains a linearly sized induced subgraph with all degrees odd
• scientific article; zbMATH DE number 1051278
• Large Induced Subgraphs with All Degrees Odd
• On induced subgraphs with odd degrees

Cites work

• scientific article; zbMATH DE number 3685495 (Why is no real title available?)
• scientific article; zbMATH DE number 1051278 (Why is no real title available?)
• A bound on judicious bipartitions of directed graphs
• All trees contain a large induced subgraph having all degrees 1 (mod \(k\))
• Every tree contains a large induced subgraph with all degrees odd
• Large Induced Subgraphs with All Degrees Odd
• Odd induced subgraphs in graphs with treewidth at most two
• On bipartitions of directed graphs with small semidegree
• On induced subgraphs of trees, with restricted degrees
• On induced subgraphs with all degree odd
• On induced subgraphs with odd degrees

Cited in

(7)

• Induced subgraphs of graphs with large chromatic number. I. Odd holes
• Odd induced subgraphs in graphs with treewidth at most two
• Flows and parity subgraphs of graphs with large odd-edge-connectivity
• Every graph contains a linearly sized induced subgraph with all degrees odd
• Maximum odd induced subgraph of a graph concerning its chromatic number
• Induced subgraphs of a tree with constraint degree
• Planar Graphs of Odd-Girth at Least 9 are Homomorphic to the Petersen Graph

This page was built for publication: Odd induced subgraphs in planar graphs with large girth

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