scientific article; zbMATH DE number 426361
From MaRDI portal
Publication:3137210
Recommendations
Cited in
(30)- Covering a graph by complete bipartite graphs
- On graph decompositions modulo \(k\)
- Efficient covering designs of the complete graph
- Covers of Eulerian graphs
- On vertex-parity edge-colorings
- Decomposition of a graph into two disjoint odd subgraphs
- Path decompositions and Gallai's conjecture
- Weak-odd chromatic index of special digraph classes
- An overview of graph covering and partitioning
- Odd decompositions and coverings of graphs
- Unique-maximum edge-colouring of plane graphs with respect to faces
- Facially-constrained colorings of plane graphs: a survey
- A bound on the total size of a cut cover
- Improved bound on facial parity edge coloring
- Facial parity edge colouring of plane pseudographs
- scientific article; zbMATH DE number 2032373 (Why is no real title available?)
- scientific article; zbMATH DE number 1792588 (Why is no real title available?)
- Sharp bounds for decomposing graphs into edges and triangles
- Notes on weak-odd edge colorings of digraphs
- The mod k $k$ chromatic index of random graphs
- Odd edge‐colorings of subdivisions of odd graphs
- The mod k k chromatic index of graphs is O(k) O(k)
- Towards the Erdős-Gallai cycle decomposition conjecture
- Towards the Erdős-Gallai cycle decomposition conjecture
- Sharp bounds for decomposing graphs into edges and triangles
- Boundedness for proper conflict-free and odd colorings
- Cover numbers by certain graph families
- On the mod k chromatic index of graphs
- On modular edge colorings of graphs
- Maximum edge-colorings of graphs
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)
