Pages that link to "Item:Q5487779"
From MaRDI portal
The following pages link to Covering the edges of a graph by three odd subgraphs (Q5487779):
Displaying 12 items.
- Facial parity edge colouring of plane pseudographs (Q442406) (← links)
- Three ways to cover a graph (Q898135) (← links)
- Covering odd cycles (Q1272187) (← links)
- Decomposition of a graph into two disjoint odd subgraphs (Q1756121) (← 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)
- Covering the edges of a graph by four odd subgraphs (Q2829922) (← links)
- Spanning even subgraphs of 3‐edge‐connected graphs (Q3652540) (← links)
- Coverability of graph by three odd subgraphs (Q5207471) (← links)
- Odd edge‐colorings of subdivisions of odd graphs (Q6081577) (← links)