scientific article; zbMATH DE number 944226
From MaRDI portal
Publication:4715286
Recommendations
- Decomposition of graphs with constraint on minimum degree
- Decomposition of bipartite graphs under degree constraints
- scientific article; zbMATH DE number 568834
- scientific article; zbMATH DE number 4014756
- Graph decomposition with constraints in the minimum degree
- Efficient algorithms for decomposing graphs under degree constraints
- scientific article; zbMATH DE number 4012650
- scientific article; zbMATH DE number 25257
- scientific article; zbMATH DE number 1156583
- scientific article; zbMATH DE number 47528
Cited in
(81)- Partitioning a graph into alliance free sets
- Decompositions to degree-constrained subgraphs are simply reducible to edge-colorings
- Partitions of graphs with high minimum degree or connectivity.
- On some open problems concerning quorum colorings of graphs
- Disjoint cycles of different lengths in graphs and digraphs
- Weak internal partition of regular graphs
- On the existence of vertex-disjoint subgraphs with high degree sum
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
- Partitions of multigraphs under minimum degree constraints
- On splitting digraphs
- Path partitions and \(P_{n}\)-free sets
- On partitions of \(K_{2, 3}\)-free graphs under degree constraints
- Almost-spanning subgraphs with bounded degree in dense graphs
- Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization
- A generalization of Stiebitz-type results on graph decomposition
- Partitions of multigraphs without \(C_4\)
- A note on the satisfactory partition problem: constant size requirement
- Some remarks on even-hole-free graphs
- Decomposition of graphs with constraint on minimum degree
- Partitions of graphs and multigraphs under degree constraints
- A note on partitions of graphs under degree constraints
- On 1-factors with prescribed lengths in tournaments
- Decomposing a graph into two subgraphs with prescribed parities of vertex degrees
- Asymptotically almost every \(2r\)-regular graph has an internal partition
- The minimum number of minimal codewords in an \([n, k]\)-code and in graphic codes
- On partitions of graphs under degree constraints
- Degree-constrained decompositions of graphs: Bounded treewidth and planarity
- The extremal function for disconnected minors
- Minors in graphs of large _r-girth
- Degree-constrained 2-partitions of graphs
- Degree constrained subgraphs
- The satisfactory partition problem
- Bipartition of graph under degree constraints
- On a conjecture of Schweser and Stiebitz
- On connected partition with degree constraints
- Partition and disjoint cycles in digraphs
- Compressing Bounded Degree Graphs
- Internal partitions of regular graphs
- Complexity and kernels for bipartition into degree-bounded induced graphs
- scientific article; zbMATH DE number 4014756 (Why is no real title available?)
- Vertex-disjoint subgraphs with high degree sums
- scientific article; zbMATH DE number 3970800 (Why is no real title available?)
- Decomposing large graphs with small graphs of high density
- On decomposition of triangle-free graphs under degree constraints
- Brief announcement: Bounded-degree cut is fixed-parameter tractable
- Nested cycles with no geometric crossings
- Graphs with degree constraints
- scientific article; zbMATH DE number 7150552 (Why is no real title available?)
- A note on almost balanced bipartitions of a graph
- A relaxed version of the Erdős-Lovász Tihany conjecture
- Dividing a graph by degrees
- A note on a cycle partition problem
- Factors with Multiple Degree Constraints in Graphs
- scientific article; zbMATH DE number 5038480 (Why is no real title available?)
- scientific article; zbMATH DE number 2230277 (Why is no real title available?)
- (Dis)assortative partitions on random regular graphs
- Friendly bisections of random graphs
- Decomposing planar graphs into graphs with degree restrictions
- Graph partitioning: an updated survey
- A note on internal partitions: the 5-regular case and beyond
- Graph partitions under average degree constraint
- Improper C-colorings of graphs
- Partitioning graphs with linear minimum degree
- Partitioning problems via random processes
- On partitions of edge-colored graphs under color degree constraints
- A note on digraph splitting
- Partition of graphs with maximum degree ratio
- Distribution of vertices required a high-degree condition on partitions of graphs under degree constraints
- Partitioning the projective plane into two incidence-rich parts
- On partitions of theta-free multigraphs under degree constraints
- What is on his mind?
- Complexity and kernels for bipartition into degree-bounded induced graphs
- Faster exponential algorithms for cut problems via geometric data structures
- Unavoidable subgraphs in digraphs with large out-degrees
- Graph decompositions without isolates
- The path partition conjecture is true for claw-free graphs
- Efficient algorithms for decomposing graphs under degree constraints
- Min-max communities in graphs: complexity and computational properties
- Non-separating subgraphs in highly connected graphs
- Standardization of perspectives into degree-splitting graph of a graph
- Satisfactory graph partition, variants, and generalizations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4715286)
