Packings by Complete Bipartite Graphs
From MaRDI portal
Recommendations
Cites work
- A matching problem with side conditions
- A Theorem on k-Saturated Graphs
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- An extension of Tutte's 1-factor theorem
- Another look at the degree constrained subgraph problem
- Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem
- F-factors of graphs: A generalized matching problem
- scientific article; zbMATH DE number 3141016 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3720956 (Why is no real title available?)
- scientific article; zbMATH DE number 3743308 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1893039 (Why is no real title available?)
- scientific article; zbMATH DE number 3893247 (Why is no real title available?)
- scientific article; zbMATH DE number 3349645 (Why is no real title available?)
- scientific article; zbMATH DE number 3409134 (Why is no real title available?)
- Maximum matching and a polyhedron with 0,1-vertices
- On factors with given components
- On generalized matching problems
- On the completeness of a generalized matching problem
- On the Complexity of General Graph Factor Problems
- Packing subgraphs in a graph
- Packings by cliques and by finite families of graphs
- Paths, Trees, and Flowers
- Reguläre Faktoren von Graphen.
- Subgraphs with prescribed valencies
- Testing Deadlock-Freedom of Computer Systems
- The Factorization of Linear Graphs
- The Factors of Graphs
- TWO THEOREMS IN GRAPH THEORY
Cited in
(52)- Edge decompositions into two kinds of graphs
- Packings by cliques and by finite families of graphs
- On matroids induced by packing subgraphs
- On the use of augmenting chains in chain packings
- A parameter linked with \(G\)-factors and the binding number
- On the tree packing problem
- Generalized partitions of graphs
- Optimal packing of induced stars in a graph
- Maximum tree-packing in time \(O(n^{5/2})\)
- Improved approximation algorithms for weighted 2-path partitions
- Orthogonal decomposition and packing of complete graphs
- On the complexity of some edge-partition problems for graphs
- Rounding in symmetric matrices and undirected graphs
- On maximum \(P_3\)-packing in claw-free subcubic graphs
- The superstar packing problem
- Quantifying hierarchical conflicts in homology statements
- On caterpillar factors in graphs
- Gadget classification
- Packing bipartite graphs with covers of complete bipartite graphs
- Packing \([1, \Delta ]\)-factors in graphs of small degree
- Oriented star packings
- Edge decompositions and rooted packings of graphs
- Some results on packing graphs in their complements
- Packing of graphic n-tuples
- scientific article; zbMATH DE number 6007715 (Why is no real title available?)
- Improved approximation algorithms for weighted 2-path partitions
- scientific article; zbMATH DE number 4148138 (Why is no real title available?)
- scientific article; zbMATH DE number 4162902 (Why is no real title available?)
- Packing bipartite graphs with covers of complete bipartite graphs
- scientific article; zbMATH DE number 15366 (Why is no real title available?)
- scientific article; zbMATH DE number 4127266 (Why is no real title available?)
- scientific article; zbMATH DE number 1156587 (Why is no real title available?)
- scientific article; zbMATH DE number 3150 (Why is no real title available?)
- Packings and Coverings of the Complete Bipartite Graph by Octagons
- On rooted packings, decompositions, and factors of graphs
- The \(K_r\)-packing problem
- Maximum tree-packing in time O(n5/2)
- Packing 2- and 3-stars into cubic graphs
- The maximum 4-vertex-path packing of a cubic graph covers at least two-thirds of its vertices
- Packing 3-vertex paths in claw-free graphs and related topics
- How many matchings cover the nodes of a graph?
- The maximum 3-star packing problem in claw-free cubic graphs
- Packing 2- and 3-stars into ( 2 , 3 )-regular graphs
- Approximation algorithms for non-sequential star packing problems
- An improved approximation algorithm for the minimum k-star partition problem
- Approximation algorithms for the k^+-star packing problem
- Approximation algorithms for non-sequential star packing problems
- Partition strategies for the maker-breaker domination game
- An improved approximation algorithm for the minimum 4-star partition problem
- Chain packing in graphs
- Looking at the stars
- Graph factors and factorization: 1985--2003: a survey
This page was built for publication: Packings by Complete Bipartite Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3728943)
