scientific article; zbMATH DE number 3400923
From MaRDI portal
Publication:5668821
zbMath0254.05101MaRDI QIDQ5668821
No author found.
Publication date: 1973
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph theory (05Cxx)
Related Items (only showing first 100 items - show all)
The graph sandwich problem for 1-join composition is NP-complete ⋮ Random graphs as a model for pregeometry ⋮ Packing spanning trees in highly essentially connected graphs ⋮ Grinberg's criterion ⋮ List-colourings of graphs ⋮ Semi-duality and the cycle double cover conjecture ⋮ Crystallographic reptiles ⋮ Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications ⋮ Cayley, Marty and Schreier hypergraphs ⋮ Global multi-output decision trees for interaction prediction ⋮ Model-based inference in CHARME. ⋮ On robust maximum flow with polyhedral uncertainty sets ⋮ Graph optimization approaches for minimal rerouting in symmetric three stage Clos networks ⋮ An upper bound for families of linearly related plane convex sets ⋮ A hypergraph model for constraint logic programming and applications to bus drivers' scheduling ⋮ Probability propagation ⋮ Niche hypergraphs ⋮ Subcompletions of representable relation algebras ⋮ Nim games with arbitrary periodic moving orders ⋮ Vertex arboricity and vertex degrees ⋮ Opposition graphs are strict quasi-parity graphs ⋮ Neighborhood hypergraph based classification algorithm for incomplete information system ⋮ Algorithmic aspects of intersection graphs and representation hypergraphs ⋮ The strongly perfectness of normal product of \(t\)-perfect graphs ⋮ Recognizing intersection graphs of linear uniform hypergraphs ⋮ Helly numbers of polyominoes ⋮ Large fault-tolerant interconnection networks ⋮ A category-theoretical approach to hypergraphs ⋮ Paths with minimum range and ratio of arc lengths ⋮ The Boolean quadratic polytope: Some characteristics, facets and relatives ⋮ A new analysis of quasianalysis ⋮ An NC algorithm for Brooks' theorem ⋮ Long monochromatic Berge cycles in colored 4-uniform hypergraphs ⋮ Rounds in combinatorial search ⋮ Time slot scheduling of compatible jobs ⋮ The Erdős-Jacobson-Lehel conjecture on potentially \(P_k\)-graphic sequence is true ⋮ Graph models for scheduling systems with machine saturation property ⋮ Micro-analyticity of the S-matrix and related functions ⋮ On the independence numbers of the cubes of odd cycles ⋮ Laplacian distribution and domination ⋮ The frequency of cyclic processes in biological multistate systems ⋮ A unified theory of symmetry for nonlinear resistive networks ⋮ Resource-sharing systems and hypergraph colorings ⋮ Parameterized fairness axioms on cycle-free graph games ⋮ Selective hypergraph colourings ⋮ A new linear programming algorithm - better or worse than the simplex method? ⋮ The \textsc{max quasi-independent set} problem ⋮ Multi-level direct \(K\)-way hypergraph partitioning with multiple constraints and fixed vertices ⋮ Link scheduling in wireless sensor networks: distributed edge-coloring revisited ⋮ On \(k\)-hypertournament matrices ⋮ Combining restarts, nogoods and bag-connected decompositions for solving csps ⋮ Partitioning multi-edge graphs ⋮ Le nombre maximum de cliques et de recouvrements par cliques des hypergraphes chromatiques complets ⋮ Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs ⋮ A generalization of the matrix-tree theorem ⋮ Efficient counting of degree sequences ⋮ Extending an extension of Grinberg's theorem ⋮ On the combinatorial problems which I would most like to see solved ⋮ Note on the outdegree of a node in random recursive trees ⋮ Monochromatic matchings in the shadow graph of almost complete hypergraphs ⋮ Orientations, lattice polytopes, and group arrangements I: Chromatic and tension polynomials of graphs ⋮ Fool's solitaire on joins and Cartesian products of graphs ⋮ Best monotone degree conditions for graph properties: a survey ⋮ Computational study on a PTAS for planar dominating set problem ⋮ Graph transformations for efficient structural analysis ⋮ Circuit decompositions and shortest circuit coverings of hypergraphs ⋮ Hamiltonian circuits, Hamiltonian paths and branching graphs of benzenoid systems ⋮ The flow index and strongly connected orientations ⋮ Gallai's problem on Dirac's construction ⋮ A note on an induced subgraph characterization of domination perfect graphs ⋮ On the Hamiltonicity of triple systems with high minimum degree ⋮ Supra-hereditary properties of hypergraphs ⋮ Weighted stability number of graphs and weighted satisfiability: the two facets of pseudo-Boolean optimization ⋮ The extended global cardinality constraint: an empirical survey ⋮ A linear algorithm for the domination number of a tree ⋮ Graphic sequences with unique realization ⋮ On maximally distant spanning trees of a graph ⋮ On the existence of k-separated finite and infinite dipaths ⋮ Minimum-weight two-connected spanning networks ⋮ Accessible single-valued neutrosophic graphs ⋮ A new decision-making method based on bipolar neutrosophic directed hypergraphs ⋮ The complexity of comparability graph recognition and coloring ⋮ Uniqueness of colorings ⋮ A note on perfect Gaussian elimination ⋮ Probabilistic graph-coloring in bipartite and split graphs ⋮ Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems ⋮ A new connection between quantum circuits, graphs and the Ising partition function ⋮ Dynamic detection of subgraphs in computer networks ⋮ Nonuniform recursive trees with vertex attraction depending on their labels ⋮ Recent trends in combinatorial optimization ⋮ NP-complete problems simplified on tree schemas ⋮ The primitivity of the strong product of two directed graphs ⋮ Deadlock-freedom in resource contentions ⋮ Computing the maximum-entropy extension of given discrete probability distributions ⋮ The sequence of upper and lower domination, independence and irredundance numbers of a graph ⋮ Finding maximum cliques in arbitrary and in special graphs ⋮ An efficient parallel algorithm for computing a large independent set in a planar graph ⋮ Chain packing in graphs ⋮ On 1-factorizability of Cayley graphs ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters
This page was built for publication:
