scientific article
From MaRDI portal
Publication:3941433
zbMath0483.05029MaRDI QIDQ3941433
No author found.
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
Disjoint Hamiltonian cycles in recursive circulant graphs ⋮ Orienting graphs to optimize reachability ⋮ A note on parallel complexity of maximum \(f\)-matching ⋮ On the number of spanning trees of multi-star related graphs ⋮ Maximum \(h\)-colourable subgraph problem in balanced graphs ⋮ A formula for the number of spanning trees of a multi-star related graph ⋮ On the number of spanning trees of a multi-complete/star related graph ⋮ On the planarity of the \(k\)-zero-divisor hypergraphs ⋮ On the hereditary \((p,q)\)-Helly property of hypergraphs, cliques, and bicliques ⋮ Graphs with maximal induced matchings of the same size ⋮ Solving job shop problems in the context of hypergraphs ⋮ Superfluous paths in strong digraphs ⋮ On several sorts of connectivity ⋮ Matchings in benzene chains ⋮ Mixed models, random utilities, and the triangle inequality ⋮ Duality and perfection for edges in cliques ⋮ Matchings and transversals in hypergraphs, domination and independence in trees ⋮ Birth and growth of multicyclic components in random hypergraphs ⋮ Optimal guard sets and the Helly property ⋮ Uniformly resolvable decompositions of \(K_v\) into \(P_3\) and \(K_3\) graphs ⋮ Discovering a junction tree behind a Markov network by a greedy algorithm ⋮ Independence densities of hypergraphs ⋮ Linear time analysis of properties of conflict-free and general Petri nets ⋮ A degree condition for cycles of maximum length in bipartite digraphs ⋮ Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms ⋮ On arc reversal in balanced digraphs ⋮ On parallel recognition of cographs ⋮ Drawn \(k\)-in-a-row games ⋮ A survey on the structure of approximation classes ⋮ A model of influence based on aggregation functions ⋮ Characterizing paths graphs on bounded degree trees by minimal forbidden induced subgraphs ⋮ Some properties of edge intersection graphs of single-bend paths on a grid ⋮ Chromatic number and complete graph substructures for degree sequences ⋮ Graph theoretical structures in logic programs and default theories ⋮ A linear-time recognition algorithm for \(P_{4}\)-reducible graphs ⋮ Graph theoretic aspects of maximizing the spectral radius of nonnegative matrices ⋮ Directed hypergraphs: introduction and fundamental algorithms -- a survey ⋮ A new property of the Lovász number and duality relations between graph parameters ⋮ On a class of kernel-perfect and kernel-perfect-critical graphs ⋮ Connectivity of Kautz networks ⋮ A note on partial Cayley graphs ⋮ A note on graphs which have upper irredundance equal to independence ⋮ The decomposition of graphs into \(k\)-connected components ⋮ Extending matchings in planar graphs. IV ⋮ Recent results on the total chromatic number ⋮ On existence theorems ⋮ Shannon-like games are difficult ⋮ Cycle structure of edge labelled graphs ⋮ Bounds relating generalized domination parameters ⋮ A characterization of intersection graphs of the maximal rectangles of a polyomino ⋮ Geometry, complexity, and combinatorics of permutation polytopes ⋮ A kernel of order \(2k - c\) for Vertex Cover ⋮ Ear decomposition for pair comparison data ⋮ Strongly linear trend-free block designs and 1-factors of representative graphs ⋮ Hypergraphs and a functional equation of Bouwkamp and de Bruijn ⋮ Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms ⋮ Chordality properties on graphs and minimal conceptual connections in semantic data models ⋮ Extending cycles in directed graphs ⋮ Minimizing the density of terminal assignments in layout design ⋮ On the power of concurrent-write PRAMs with read-only memory ⋮ The set coincidence game: Complexity, attainability, and symmetric strategies ⋮ Flows in circulant graphs of odd order are sums of Hamilton cycles ⋮ Gallai-type results for multiple boxes and forests ⋮ The polytope of degree sequences ⋮ Recognizing sign solvable graphs ⋮ Recognizing vertex intersection graphs of paths on bounded degree trees ⋮ TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph ⋮ Structurally fixed modes: Decomposition and reachability ⋮ A min-max relation for the partial q-colourings of a graph. II: Box perfection ⋮ On domination and independent domination numbers of a graph ⋮ On the relationship between the genus and the cardinality of the maximum matchings of a graph ⋮ The continuous center set of a network ⋮ Matching relations and the dimensional structure of social choices ⋮ Connections in acyclic hypergraphs ⋮ Applications of edge coverings by cliques ⋮ Decomposition of large uniform hypergraphs ⋮ Arboricity: an acyclic hypergraph decomposition problem motivated by database theory ⋮ A short constructive proof of A.R. Rao's characterization of potentially \(K_{r+1}\)-graphic sequences ⋮ A mathematical approach on representation of competitions: competition cluster hypergraphs ⋮ More on limited packings in graphs ⋮ On kernels and semikernels of digraphs ⋮ A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs ⋮ On optimal linear arrangements of trees ⋮ Graph decompositions without isolates ⋮ On a robustness property of PBIBD ⋮ The edge intersection graphs of paths in a tree ⋮ Dominating sets for split and bipartite graphs ⋮ Chromatic number of classes of matrices of zeros and ones ⋮ A geometric approach to forbidden minors for GF(3) ⋮ NP-completeness of some problems of partitioning and covering in graphs ⋮ Hamiltonian decompositions of complete graphs ⋮ A family of perfect graphs associated with directed graphs ⋮ A parallel-design distributed-implementation (PDDI) general-purpose computer ⋮ Degree sequences of matrogenic graphs ⋮ Graphs whose neighborhoods have no special cycles ⋮ Geometrical solution of an intersection problem for two hypergraphs ⋮ Tolerance graphs ⋮ Hypergraphs and Whitney's theorem on edge-isomorphisms of graphs ⋮ Generation of trees of a graph with the use of decomposition ⋮ Random partition models and complementary clustering of Anglo-Saxon place-names
This page was built for publication:
