The following pages link to (Q3137210):
Displaying 20 items.
- Improved bound on facial parity edge coloring (Q390304) (← links)
- Facial parity edge colouring of plane pseudographs (Q442406) (← links)
- Maximum edge-colorings of graphs (Q907836) (← links)
- Covering a graph by complete bipartite graphs (Q1363672) (← links)
- On graph decompositions modulo \(k\) (Q1377772) (← links)
- Covers of Eulerian graphs (Q1417961) (← links)
- On vertex-parity edge-colorings (Q1702821) (← links)
- Decomposition of a graph into two disjoint odd subgraphs (Q1756121) (← links)
- Path decompositions and Gallai's conjecture (Q1767666) (← links)
- Weak-odd chromatic index of special digraph classes (Q2104925) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Odd decompositions and coverings of graphs (Q2225430) (← links)
- Unique-maximum edge-colouring of plane graphs with respect to faces (Q2341735) (← links)
- Facially-constrained colorings of plane graphs: a survey (Q2401805) (← links)
- A bound on the total size of a cut cover (Q2484376) (← links)
- Notes on weak-odd edge colorings of digraphs (Q5090189) (← links)
- The mod k $k$ chromatic index of random graphs (Q6047962) (← links)
- Odd edge‐colorings of subdivisions of odd graphs (Q6081577) (← links)
- The mod k $k$ chromatic index of graphs is O(k) $O(k)$ (Q6093146) (← links)
- Towards the Erdős-Gallai cycle decomposition conjecture (Q6184561) (← links)
