On induced subgraphs with all degree odd

DOI10.1007/S003730170028MaRDI QIDQ5952391zbMATH OpenOpenAlexFDO

Authors Alex Scott

Publication date 9 January 2002

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

Full work available at URL https://doi.org/10.1007/s003730170028

zbMATH Keywords

random graphsvertex partitionvertex covers

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Large Induced Subgraphs with All Degrees Odd
• On induced subgraphs with odd degrees
• Every graph contains a linearly sized induced subgraph with all degrees odd
• Every tree contains a large induced subgraph with all degrees odd
• scientific article; zbMATH DE number 894703

Cited in

(11)

• Odd induced subgraphs in planar graphs with large girth
• Note on Perfect Forests
• Note on Perfect Forests in Digraphs
• On subgraphs with degrees of prescribed residues in the random graph
• Counting partitions of Gn,1/2$$ {G}_{n,1/2} $$ with degree congruence conditions
• Every graph contains a linearly sized induced subgraph with all degrees odd
• Maximum odd induced subgraph of a graph concerning its chromatic number
• Perfect forests in graphs and their extensions
• Induced subgraphs of a tree with constraint degree
• A result on large induced subgraphs with prescribed residues in bipartite graphs
• On the complexity of finding large odd induced subgraphs and odd colorings

This page was built for publication: On induced subgraphs with all degree odd

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