scientific article; zbMATH DE number 426361
From MaRDI portal
Publication:3137210
Recommendations
Cited in
(25)- Facial parity edge colouring of plane pseudographs
- An overview of graph covering and partitioning
- Weak-odd chromatic index of special digraph classes
- Notes on weak-odd edge colorings of digraphs
- Sharp bounds for decomposing graphs into edges and triangles
- On graph decompositions modulo \(k\)
- Sharp bounds for decomposing graphs into edges and triangles
- A bound on the total size of a cut cover
- Odd edge‐colorings of subdivisions of odd graphs
- Decomposition of a graph into two disjoint odd subgraphs
- The mod k $k$ chromatic index of random graphs
- The mod k $k$ chromatic index of graphs is O(k) $O(k)$
- Facially-constrained colorings of plane graphs: a survey
- Odd decompositions and coverings of graphs
- Towards the Erdős-Gallai cycle decomposition conjecture
- Covering a graph by complete bipartite graphs
- scientific article; zbMATH DE number 1792588 (Why is no real title available?)
- On vertex-parity edge-colorings
- Covers of Eulerian graphs
- Maximum edge-colorings of graphs
- Towards the Erdős-Gallai cycle decomposition conjecture
- Unique-maximum edge-colouring of plane graphs with respect to faces
- Path decompositions and Gallai's conjecture
- scientific article; zbMATH DE number 2032373 (Why is no real title available?)
- Improved bound on facial parity edge coloring
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3137210)
