scientific article; zbMATH DE number 3344609

zbMath0217.02601MaRDI QIDQ5620621

Publication date: 1970

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)

Related Items (only showing first 100 items - show all)

Equitable chromatic number of weak modular product of Some graphs ⋮ Tilings in vertex ordered graphs ⋮ Minimum Degrees for Powers of Paths and Cycles ⋮ Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem ⋮ Dirac-type results for tilings and coverings in ordered graphs ⋮ Unnamed Item ⋮ Improving lower bounds for equitable chromatic number ⋮ The minimum degree threshold for perfect graph packings ⋮ A Degree Sequence Strengthening of the Vertex Degree Threshold for a Perfect Matching in 3-Uniform Hypergraphs ⋮ Powers of Hamilton cycles of high discrepancy are unavoidable ⋮ A Tabu Search Heuristic for the Equitable Coloring Problem ⋮ Proportional choosability of complete bipartite graphs ⋮ Equitable clique-coloring in claw-free graphs with maximum degree at most 4 ⋮ Stability for vertex cycle covers ⋮ On Equitable Coloring of Book Graph Families ⋮ Inverse problems for minimal complements and maximal supplements ⋮ On Equitable List Arboricity of Graphs ⋮ On equitable chromatic number of Tadpole graph T_{m,n} ⋮ Disjoint cycles and chorded cycles in a graph with given minimum degree ⋮ Equitable list vertex colourability and arboricity of grids ⋮ Asymptotic multipartite version of the Alon-Yuster theorem ⋮ Triangle resilience of the square of a Hamilton cycle in random graphs ⋮ The threshold bias of the clique-factor game ⋮ Equitable colorings of corona multiproducts of graphs ⋮ A greedy algorithm for the social golfer and the Oberwolfach problem ⋮ Equitable colorings of hypergraphs with \(r\) colors ⋮ Building Spanning Trees Quickly in Maker-Breaker Games ⋮ On resilience of connectivity in the evolution of random graphs ⋮ Spanning trees in dense directed graphs ⋮ The minimum number of clique-saturating edges ⋮ Codegree threshold for tiling balanced complete \(3\)-partite \(3\)-graphs and generalized \(4\)-cycles ⋮ A degree sequence version of the Kühn-Osthus tiling theorem ⋮ Extremal problems in hypergraph colourings ⋮ Completion and deficiency problems ⋮ Tiling multipartite hypergraphs in quasi-random hypergraphs ⋮ A rainbow blow‐up lemma ⋮ A rainbow blow-up lemma for almost optimally bounded edge-colourings ⋮ The bandwidth theorem for locally dense graphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ A blow-up lemma for approximate decompositions ⋮ A Sharp Dirac–Erdős Type Bound for Large Graphs ⋮ Covering and tiling hypergraphs with tight cycles ⋮ Perfect packings with complete graphs minus an edge ⋮ Packing \(d\)-degenerate graphs ⋮ An Ore-type theorem on equitable coloring ⋮ Equitable partitions into matchings and coverings in mixed graphs ⋮ Equitable coloring planar graphs with large girth ⋮ Constructing Armstrong tables for general cardinality constraints and not-null constraints ⋮ Vertex-disjoint rainbow triangles in edge-colored graphs ⋮ Chromatic number via Turán number ⋮ Equitable partition of planar graphs ⋮ Random perturbation of sparse graphs ⋮ Theoretical aspects of equitable partition of networks into sparse modules ⋮ Sets of unit vectors with small subset sums ⋮ The complexity of perfect matchings and packings in dense hypergraphs ⋮ Unnamed Item ⋮ On Hamiltonian cycles in hypergraphs with dense link graphs ⋮ On equitable colorings of hypergraphs ⋮ On a Ramsey--Turán Variant of the Hajnal--Szemerédi Theorem ⋮ A note on the equitable choosability of complete bipartite graphs ⋮ On list equitable total colorings of the generalized theta graph ⋮ Locally boundedk-colorings of trees ⋮ Triangle‐factors in pseudorandom graphs ⋮ Tilings in Randomly Perturbed Dense Graphs ⋮ Routing in Undirected Graphs with Constant Congestion ⋮ Very fast construction of bounded‐degree spanning graphs via the semi‐random graph process ⋮ Embedding spanning subgraphs in uniformly dense and inseparable graphs ⋮ Relaxed equitable colorings of planar graphs with girth at least 8 ⋮ Equitable partition of plane graphs with independent crossings into induced forests ⋮ Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles ⋮ Equitable colorings of hypergraphs with few edges ⋮ Codegree Thresholds for Covering 3-Uniform Hypergraphs ⋮ Clique Counting in MapReduce ⋮ Vertex-disjoint double chorded cycles in bipartite graphs ⋮ Proportional 2-choosability with a bounded palette ⋮ Hamiltonian cycles above expectation in \(r\)-graphs and quasi-random \(r\)-graphs ⋮ Proportional choosability: a new list analogue of equitable coloring ⋮ Sprinkling a Few Random Edges Doubles the Power ⋮ Powers of Hamiltonian cycles in multipartite graphs ⋮ Sharp concentration of the equitable chromatic number of dense random graphs ⋮ A discrepancy version of the Hajnal–Szemerédi theorem ⋮ Triangle-degrees in graphs and tetrahedron coverings in 3-graphs ⋮ Asymptotically optimal \(K_k\)-packings of dense graphs via fractional \(K_k\)-decompositions ⋮ Perfect colorings of regular graphs ⋮ On the equitable choosability of the disjoint union of stars ⋮ TILING DIRECTED GRAPHS WITH TOURNAMENTS ⋮ Minimum degree conditions for large subgraphs ⋮ Forcing spanning subgraphs via Ore type conditions ⋮ Cyclic triangle factors in regular tournaments ⋮ Anti-Ramsey numbers for vertex-disjoint triangles ⋮ On chromatic number and minimum cut ⋮ Equitable total-coloring of subcubic graphs ⋮ Maker-Breaker Games on Randomly Perturbed Graphs ⋮ Equitable partition of graphs into induced forests ⋮ Equitable colourings of Borel graphs ⋮ Ramsey numbers for complete graphs versus generalized fans ⋮ Results and problems on chorded cycles: a survey ⋮ Equitable list-coloring for \(C_{5}\)-free plane graphs without adjacent triangles ⋮ An Evans-Style Result for Block Designs ⋮ Extremal graphs for two vertex-disjoint copies of a clique

This page was built for publication: