scientific article
From MaRDI portal
Publication:3992558
zbMath0682.05003MaRDI QIDQ3992558
Publication date: 17 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
planar graphsIndependenceGraphsNetworksTreesSearchingMatchingsPathsPlanarityCyclesCircuitsExtremal Theory
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Graph theory (05Cxx)
Related Items (28)
Finding a complete matching with the maximum product on weighted bipartite graphs ⋮ Packing tripods: narrowing the density gap ⋮ Edge coloring: a natural model for sports scheduling ⋮ An efficient graph technique based dual-type algorithm for NMNF problems with large capacity constraints ⋮ Characterizing forbidden pairs for hamiltonian properties ⋮ A mathematical basis for egress complexity ⋮ Parallel graph component labelling with GPUs and CUDA ⋮ Assignment of tools to machines in a flexible manufacturing system ⋮ A tutorial on graph models for scheduling round‐robin sports tournaments ⋮ Bargaining in a network of buyers and sellers. ⋮ An optimal PRAM algorithm for a spanning tree on trapezoid graphs. ⋮ Bargaining and network structure: an experiment ⋮ Finding the most vital edge with respect to minimum spanning tree in weighted graphs ⋮ Weighted graphs and university course timetabling ⋮ An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs ⋮ On independent generalized degrees and independence numbers in \(K(1,m)\)- free graphs ⋮ On isomorphic subgraphs ⋮ Global stability of complex balanced mechanisms ⋮ A dynamic network population model with strategic link formation governed by individual preferences ⋮ Crack STIT tessellations: characterization of stationary random tessellations stable with respect to iteration ⋮ A characterisation of some 2-connected graphs and a comment on an algorithmic proof of Brooks' theorem ⋮ Jump number maximization for proper interval graphs and series-parallel graphs ⋮ Majority vote of even and odd experts in a polychotomous choice situation ⋮ Rabin numbers of Butterfly networks ⋮ Traceability in graphs with forbidden triples of subgraphs ⋮ Forbidden triples and traceability: A characterization ⋮ A manifold independent approach to understanding transport in stochastic dynamical systems ⋮ An algorithm for winning coalitions in indirect control of corporations
This page was built for publication:
