The following pages link to Splitting digraphs (Q3419770):
Displaying 22 items.
- Finding good 2-partitions of digraphs. I. Hereditary properties (Q290530) (← links)
- Vertex-disjoint subtournaments of prescribed minimum outdegree or minimum semidegree: proof for tournaments of a conjecture of Stiebitz (Q666527) (← links)
- Split digraphs (Q764900) (← links)
- A note on subdigraphs of digraphs with large outdegrees (Q791535) (← links)
- Conflict graphs and the SINR-capacity of the mean power scheme (Q896135) (← links)
- Decomposing edge-colored graphs under color degree constraints (Q1689962) (← links)
- Out-degree reducing partitions of digraphs (Q1704574) (← links)
- On splitting digraphs (Q1750217) (← links)
- Majority colorings of sparse digraphs (Q2030755) (← links)
- Representing split graphs by words (Q2158202) (← links)
- The parameterized complexity landscape of finding 2-partitions of digraphs (Q2330099) (← links)
- Vertex coloring edge-weighted digraphs (Q2348711) (← links)
- Degree-constrained 2-partitions of graphs (Q2419120) (← links)
- Majority colourings of digraphs (Q2628255) (← links)
- Finding good 2-partitions of digraphs. II. Enumerable properties (Q2629228) (← links)
- Partition and disjoint cycles in digraphs (Q2698538) (← links)
- Difference labelling of digraphs (Q4668436) (← links)
- Disjoint Cycles with Length Constraints in Digraphs of Large Connectivity or Large Minimum Degree (Q5084095) (← links)
- Generalized Majority Colourings of Digraphs (Q5373832) (← links)
- Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties (Q6057659) (← links)
- Subdigraphs of prescribed size and out‐degree (Q6142660) (← links)
- New results on a problem of Alon (Q6658067) (← links)
