Decomposition of toroidal graphs without some subgraphs
From MaRDI portal
Recommendations
- Decompositions of graphs of nonnegative characteristic with some forbidden subgraphs
- A \((2, 1)\)-decomposition of planar graphs without intersecting 3-cycles and adjacent \(4^-\)-cycles
- Decomposing toroidal graphs into circuits and edges
- Decomposing planar graphs into graphs with degree restrictions
- The structure of \(K_{3,3}\)-subdivision-free toroidal graphs
Cites work
- scientific article; zbMATH DE number 1250667 (Why is no real title available?)
- A note on list improper coloring of plane graphs
- A note on list improper coloring planar graphs
- Decomposing planar graphs into graphs with degree restrictions
- Decomposition of planar graphs with forbidden configurations
- Decompositions of graphs of nonnegative characteristic with some forbidden subgraphs
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- List Improper Colourings of Planar Graphs
- On DP-coloring of graphs and multigraphs
- On-line DP-coloring of graphs
- Planar graphs are 1-relaxed, 4-choosable
- The Alon-Tarsi number of planar graphs
- The Alon-Tarsi number of planar graphs without cycles of lengths 4 and \(l\)
- The game coloring number of pseudo partial \(k\)-trees
Cited in
(2)
This page was built for publication: Decomposition of toroidal graphs without some subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6178668)