Decomposition of toroidal graphs without some subgraphs
From MaRDI portal
Publication:6178668
DOI10.1007/s40840-023-01631-xzbMath1530.05155OpenAlexW4390507288MaRDI QIDQ6178668
Publication date: 16 January 2024
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40840-023-01631-x
Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Unnamed Item
- Planar graphs are 1-relaxed, 4-choosable
- A note on list improper coloring of plane graphs
- The Alon-Tarsi number of planar graphs
- The game coloring number of pseudo partial \(k\)-trees
- On-line DP-coloring of graphs
- The Alon-Tarsi number of planar graphs without cycles of lengths 4 and \(l\)
- On DP-coloring of graphs and multigraphs
- Decomposition of planar graphs with forbidden configurations
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- List Improper Colourings of Planar Graphs
- A note on list improper coloring planar graphs
- Decomposing planar graphs into graphs with degree restrictions
- Decompositions of graphs of nonnegative characteristic with some forbidden subgraphs
This page was built for publication: Decomposition of toroidal graphs without some subgraphs