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)

An Asymptotic Multipartite Kühn--Osthus Theorem ⋮ Triangles in randomly perturbed graphs ⋮ Irregular subgraphs ⋮ On deficiency problems for graphs ⋮ A spanning bandwidth theorem in random graphs ⋮ Ultimate greedy approximation of independent sets in subcubic graphs ⋮ Bandwidth, treewidth, separators, expansion, and universality ⋮ Embedding clique-factors in graphs with low $\ell$-independence number ⋮ A large tree is $tK_m$-good ⋮ Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs ⋮ Graph Tilings in Incompatibility Systems ⋮ Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu ⋮ Rainbow spanning structures in graph and hypergraph systems ⋮ Equitable critical graphs ⋮ Clique-factors in graphs with sublinear -independence number ⋮ Shotgun reconstruction in the hypercube ⋮ Factors in randomly perturbed hypergraphs ⋮ Covering cycles in sparse graphs ⋮ On sufficient conditions for spanning structures in dense graphs ⋮ Independence number of hypergraphs under degree conditions ⋮ Strong coloring 2‐regular graphs: Cycle restrictions and partial colorings ⋮ Results about the total chromatic number and the conformability of some families of circulant graphs ⋮ Structural parameterizations for equitable coloring: complexity, FPT algorithms, and kernelization ⋮ A STUDY ON EQUITABLE CHROMATIC AND THRESHOLD OF MYCIELSKIAN OF GRAPHS ⋮ F$F$‐factors in Quasi‐random Hypergraphs ⋮ A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Verification ⋮ A Ramsey–Turán theory for tilings in graphs ⋮ Minimum degree conditions for containing an $r$-regular $r$-connected spanning subgraph ⋮ Extremal numbers for disjoint copies of a clique ⋮ The complete value of the Turán number of $3K_{p+1}$ ⋮ An Extension of the Hajnal–Szemerédi Theorem to Directed Graphs ⋮ On Directed Versions of the Hajnal–Szemerédi Theorem ⋮ Perfect Packings in Quasirandom Hypergraphs II ⋮ Minimum Codegree Threshold forC₆³-Factors in 3-Uniform Hypergraphs ⋮ Exact Minimum Codegree Threshold for K⁻₄-Factors ⋮ Edge-decompositions of graphs with high minimum degree ⋮ Tiling edge-ordered graphs with monotone paths and other structures ⋮ Powers of Hamilton cycles in dense graphs perturbed by a random geometric graph ⋮ Sufficient conditions for perfect mixed tilings ⋮ Spanning subdivisions in Dirac graphs ⋮ Spanning subdivisions in dense digraphs ⋮ Irregularity strength of dense graphs ⋮ The binding number of a graph and its Anderson number ⋮ Independent triangles covering given vertices of a graph ⋮ On the equitable chromatic number of complete $n$-partite graphs ⋮ Packing $K_r$s in bounded degree graphs ⋮ A median-type condition for graph tiling ⋮ Cycle-factors in oriented graphs ⋮ Gap one bounds for the equitable chromatic number of block graphs ⋮ Equitable and $m$-bounded coloring of split graphs ⋮ Equitable colorings of $l$-corona products of cubic graphs ⋮ Equitable cluster partition of planar graphs with girth at least 12 ⋮ Your rugby mates don't need to know your colleagues: triadic closure with edge colors ⋮ Minimum degree threshold for $H$-factors with high discrepancy ⋮ $H$-factors in graphs with small independence number ⋮ Powers of Hamiltonian cycles in $\mu$-inseparable graphs ⋮ A robust Corrádi-Hajnal theorem ⋮ Cliques in squares of graphs with maximum average degree less than 4 ⋮ Equitable coloring in 1-planar graphs ⋮ Turán number of two vertex-disjoint copies of cliques. ⋮ Compatible powers of Hamilton cycles in dense graphs ⋮ On Komlós’ tiling theorem in random graphs ⋮ Continuity of Multimarginal Optimal Transport with Repulsive Cost ⋮ A Degree Sequence Komlós Theorem ⋮ Transitive Tournament Tilings in Oriented Graphs with Large Minimum Total Degree ⋮ An Extension of the Blow-up Lemma to Arrangeable Graphs ⋮ Transversal factors and spanning trees ⋮ Perfect packings in quasirandom hypergraphs. I. ⋮ Independent cycles with limited size in a graph ⋮ The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs ⋮ Vertex-disjoint subgraphs with high degree sums ⋮ Equitable colorings of non-uniform simple hypergraphs ⋮ Equitable colorings of nonuniform hypergraphs ⋮ Equitable coloring and equitable choosability of graphs with small maximum average degree ⋮ A DSATUR-based algorithm for the equitable coloring problem ⋮ On the Corrádi-Hajnal theorem and a question of Dirac ⋮ Decomposition of bipartite graphs into special subgraphs ⋮ On equitable coloring of bipartite graphs ⋮ Edge coloring complete uniform hypergraphs with many components ⋮ Equitable colorings of Kronecker products of graphs ⋮ Equitable and equitable list colorings of graphs ⋮ Equitable and list equitable colorings of planar graphs without 4-cycles ⋮ Equitable colorings of planar graphs without short cycles ⋮ Equitable vertex arboricity of graphs ⋮ Packing $k$-partite $k$-uniform hypergraphs ⋮ On directed versions of the Corrádi-Hajnal corollary ⋮ Packing two graphs of even girth 10 ⋮ Covering and tiling hypergraphs with tight cycles ⋮ Equitable $\Delta$-coloring of graphs ⋮ Approximate multipartite version of the Hajnal-Szemerédi theorem ⋮ The extremal function for partial bipartite tilings ⋮ Colorful triangle counting and a \textsc{MapReduce} implementation ⋮ On the existence of vertex-disjoint subgraphs with high degree sum ⋮ On the complexity of some colorful problems parameterized by treewidth ⋮ A note on relaxed equitable coloring of graphs ⋮ Directed domination in oriented graphs ⋮ On multipartite Hajnal-Szemerédi theorems ⋮ Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Disjoint cliques in claw-free graphs

This page was built for publication: