Pages that link to "Item:Q5241609"
From MaRDI portal
The following pages link to Bipartite spanning sub(di)graphs induced by 2‐partitions (Q5241609):
Displaying 10 items.
- Finding good 2-partitions of digraphs. I. Hereditary properties (Q290530) (← links)
- NP-completeness of some problems of partitioning and covering in graphs (Q794673) (← links)
- Bipartite subgraphs of integer weighted graphs (Q1381843) (← links)
- Degree constrained 2-partitions of semicomplete digraphs (Q1784748) (← links)
- The parameterized complexity landscape of finding 2-partitions of digraphs (Q2330099) (← links)
- Finding good 2-partitions of digraphs. II. Enumerable properties (Q2629228) (← links)
- The complexity of finding low chromatic spanning sub(di)graphs with prescribed connectivity properties (Q2686111) (← links)
- Graphs with disjoint 2-dominating sets (Q5863482) (← links)
- Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties (Q6057659) (← links)
- Classes of intersection digraphs with good algorithmic properties (Q6201028) (← links)