Maximum odd induced subgraph of a graph concerning its chromatic number

DOI10.1002/jgt.23148MaRDI QIDQ6642508

Baoyindureng Wu, Tao Wang

Publication date: 24 November 2024

Published in: Journal of Graph Theory (Search for Journal in Brave)

zbMATH Keywords

induced subgraphschromatic numberodd subgraphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On induced subgraphs of trees, with restricted degrees
• On induced subgraphs with odd degrees
• All trees contain a large induced subgraph having all degrees 1 (mod \(k\))
• Every tree contains a large induced subgraph with all degrees odd
• Every graph contains a linearly sized induced subgraph with all degrees odd
• Odd induced subgraphs in graphs with treewidth at most two
• Odd induced subgraphs in planar graphs with large girth
• Note on Perfect Forests
• Large Induced Subgraphs with All Degrees Odd
• How many disjoint 2-edge paths must a cubic graph have?
• On the complexity of finding large odd induced subgraphs and odd colorings
• On induced subgraphs with all degree odd

This page was built for publication: Maximum odd induced subgraph of a graph concerning its chromatic number

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