Pages that link to "Item:Q3661610"
From MaRDI portal
The following pages link to Graph decomposition with constraints on the connectivity and minimum degree (Q3661610):
Displayed 17 items.
- Finding good 2-partitions of digraphs. I. Hereditary properties (Q290530) (← links)
- Bipartitions of highly connected tournaments (Q322194) (← links)
- Partition of graphs with condition on the connectivity and minimum degree (Q787160) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- Non-separating subgraphs in highly connected graphs (Q905893) (← links)
- Approximation of satisfactory bisection problems (Q931729) (← links)
- Satisfactory graph partition, variants, and generalizations (Q976309) (← links)
- Partitioning a graph into alliance free sets (Q1025928) (← links)
- Graph decomposition with constraints in the minimum degree (Q1102305) (← links)
- Graphical decompositions (Q1322291) (← links)
- Partitions of graphs with high minimum degree or connectivity. (Q1405098) (← links)
- Path partitions and \(P_{n}\)-free sets (Q1763347) (← links)
- The minimum number of minimal codewords in an \([n, k]\)-code and in graphic codes (Q2341750) (← links)
- Bipartition of graph under degree constraints (Q2515316) (← links)
- Finding good 2-partitions of digraphs. II. Enumerable properties (Q2629228) (← links)
- Internal Partitions of Regular Graphs (Q2825476) (← links)
- Partitioning a Graph into Highly Connected Subgraphs (Q3188667) (← links)