Decomposing graphs of nonnegative characteristic into subgraphs with degree restrictions

DOI10.1016/J.DISC.2024.113965MaRDI QIDQ6494943

Xiangwen Li, Lin Niu

Publication date: 30 April 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

acyclic orientationdefective choosabilityAlon-Tarsi numberdecompostion\(d\)-generate

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Planar graphs are 1-relaxed, 4-choosable
• Covering planar graphs with forests, one having bounded maximum degree
• Flows and generalized coloring theorems in graphs
• The game coloring number of pseudo partial \(k\)-trees
• The Alon-Tarsi number of a planar graph minus a matching
• Refined activation strategy for the marking game
• Decomposition of planar graphs with forbidden configurations
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Combinatorial Nullstellensatz
• Game chromatic number of outerplanar graphs
• List Improper Colourings of Planar Graphs
• Decomposition of Finite Graphs Into Forests
• Decomposing planar graphs into graphs with degree restrictions

This page was built for publication: Decomposing graphs of nonnegative characteristic into subgraphs with degree restrictions

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