Paths, Trees, and Flowers
From MaRDI portal
Publication:5341586
DOI10.4153/CJM-1965-045-4zbMath0132.20903OpenAlexW4233756358WikidataQ55920169 ScholiaQ55920169MaRDI QIDQ5341586
Publication date: 1965
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4153/cjm-1965-045-4
Related Items (only showing first 100 items - show all)
Tractability in constraint satisfaction problems: a survey ⋮ Two function algebras defining functions in \(\mathsf{NC}^k\) Boolean circuits ⋮ Optimum distance flag codes from spreads via perfect matchings in graphs ⋮ Traveling salesman problems in temporal graphs ⋮ Augmenting approach for some maximum set problems ⋮ A \((2 + \epsilon ) k\)-vertex kernel for the dual coloring problem ⋮ Hierarchical \(b\)-matching ⋮ Counting induced subgraphs: an algebraic approach to \(\#\)W[1-hardness] ⋮ Additive approximation of generalized Turán questions ⋮ Euclidean maximum matchings in the plane -- local to global ⋮ A query-efficient quantum algorithm for maximum matching on general graphs ⋮ Parallel approximation algorithms for maximum weighted matching in general graphs ⋮ The difference between the metric dimension and the determining number of a graph ⋮ Gallai-Edmonds decomposition as a pruning technique ⋮ Computing equilibria: a computational complexity perspective ⋮ Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period ⋮ Deterministic versus randomized adaptive test cover ⋮ Incremental assignment problem ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ Computational complexity of the semantics of some natural language constructions ⋮ On the maximum even factor in weakly symmetric graphs ⋮ A characterization of the graphs in which the transversal number equals the matching number ⋮ Excessive factorizations of bipartite multigraphs ⋮ Induced graph packing problems ⋮ König-Egerváry graphs are non-Edmonds ⋮ Maximum matching in multi-interface networks ⋮ Induced matchings in subcubic graphs without short cycles ⋮ Matchings in graphs of odd regularity and girth ⋮ Approximation with a fixed number of solutions of some multiobjective maximization problems ⋮ On vertex independence number of uniform hypergraphs ⋮ Altruistically unbalanced kidney exchange ⋮ On the recognition of fuzzy circular interval graphs ⋮ Jenő Egerváry: from the origins of the Hungarian algorithm to satellite communication ⋮ Exact algorithms for dominating set ⋮ Editing graphs to satisfy degree constraints: a parameterized approach ⋮ Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem ⋮ Partitioning planar graphs: a fast combinatorial approach for max-cut ⋮ Tree search and quantum computation ⋮ A short proof of the Berge-Tutte formula and the Gallai-Edmonds structure theorem ⋮ Nash-solvable two-person symmetric cycle game forms ⋮ A simple reduction from maximum weight matching to maximum cardinality matching ⋮ FPT algorithms for path-transversal and cycle-transversal problems ⋮ Combinatorial and computational aspects of graph packing and graph decomposition ⋮ Randomly colouring graphs (a combinatorial view) ⋮ Colouring graphs when the number of colours is almost the maximum degree ⋮ On matching cover of graphs ⋮ Certifying algorithms ⋮ Optimizing regenerator cost in traffic grooming ⋮ Polynomial-time perfect matchings in dense hypergraphs ⋮ The complexity of the zero-sum 3-flows ⋮ Distributed algorithms for covering, packing and maximum weighted matching ⋮ Exploring the tractability border in epistemic tasks ⋮ A superlocal version of Reed's conjecture ⋮ Per-spectral characterizations of graphs with extremal per-nullity ⋮ Simulated versus reduced noise quantum annealing in maximum independent set solution to wireless network scheduling ⋮ Approximate triclique coloring for register allocation ⋮ Counting the number of perfect matchings in \(K_{5}\)-free graphs ⋮ Two complexity results for the vertex coloring problem ⋮ Nash equilibria in the two-player kidney exchange game ⋮ On paths avoding forbidden pairs of vertices in a graph ⋮ Bond graphs. II: Causality and singularity ⋮ Greedy matching: guarantees and limitations ⋮ Packings and perfect path double covers of maximal planar graphs ⋮ Minimum vertex weighted deficiency of \((g,f)\)-factors: A greedy algorithm ⋮ A generalized hypergreedy algorithm for weighted perfect matching ⋮ Finite-model theory -- A personal perspective ⋮ Graph editing problems with extended regularity constraints ⋮ Efficient stabilization of cooperative matching games ⋮ Kidney exchange: an egalitarian mechanism ⋮ A kernel of order \(2k - c\) for Vertex Cover ⋮ My experiences as a student and researcher in OR during the 1960's and 70's ⋮ Strongly linear trend-free block designs and 1-factors of representative graphs ⋮ Augmenting graphs for independent sets ⋮ Reconstructing polygons from scanner data ⋮ On average lower independence and domination numbers in graphs ⋮ A combinatoric interpretation of dual variables for weighted matching and \(f\)-factors ⋮ A new analysis of a self-stabilizing maximum weight matching algorithm with approximation ratio 2 ⋮ Two easy duality theorems for product partial orders ⋮ A min-max relation for stable sets in graphs with no odd-\(K_ 4\) ⋮ Spanning trees of 3-uniform hypergraphs ⋮ Simulating the impact of crossover kidney transplantation on the Nord Italia transplant program ⋮ Maximum induced matching of hexagonal graphs ⋮ Heuristics for the mixed swapping problem ⋮ Blossom V: A new implementation of a minimum cost perfect matching algorithm ⋮ \(b\)-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs ⋮ Alternating Whitney sums and matchings in trees. II ⋮ The perfectly matchable subgraph polytope of an arbitrary graph ⋮ Packing paths perfectly ⋮ A note on the separation problem for the matching matroid ⋮ Induced packing of odd cycles in planar graphs ⋮ Combinatorial optimization with 2-joins ⋮ On matroid parity and matching polytopes ⋮ Spectral aspects of symmetric matrix signings ⋮ A characterization of König-Egerváry graphs with extendable vertex covers ⋮ Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem ⋮ A partitioning algorithm for minimum weighted Euclidean matching ⋮ A comparison of heuristics and relaxations for the capacitated plant location problem ⋮ Pairwise kidney exchange ⋮ A degree sequence Hajnal-Szemerédi theorem ⋮ Fast algorithms for the undirected negative cost cycle detection problem
This page was built for publication: Paths, Trees, and Flowers
