scientific article
From MaRDI portal
zbMath0483.05029MaRDI QIDQ3941433
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On hamiltonian circuits in Cayley diagrams, On set systems determined by intersections, A dense infinite Sidon sequence, Obstructions for regular colorings, The helly-type property of non-trivial intervals on a tree, Alpha-balanced graphs and matrices and GF(3)-representability of matroids, Matching in modular lattices, Uniformly finite-to-one and onto extensions of homomorphisms between strongly connected graphs, Chromatic optimisation: Limitations, objectives, uses, references, Longest paths in bipartite digraphs, Arc-disjoint circuits in digraphs, Circuits through specified edges, Minimizing irregularities in sports schedules using graph theory, Another look at the degree constrained subgraph problem, Snarks of order 18, Planar kernel and Grundy with \(d\leq 3\), \(dout\leq 2\), \(din\leq 2\) are NP- complete, Theory of annihilation games. I, On stable set polyhedra for K//(1,3)free graphs, On the lotto problem, A new generalisation of graph theory, Size bounds for superconcentrators, Upper bound on the order of tau-critical hypergraphs, Meyniel graphs are strongly perfect, R-domination of block graphs, On the maximum number of independent edges in cubic graphs, Characterizations of extreme normalized circulations satisfying linear constraints, On Hamiltonian circuits in Cartesian products of Cayley digraphs, An appraisal of computational complexity for operations researchers, A difficulty in particular Shannon-like games, Chordal graphs and upper irredundance, upper domination and independence, Regular totally domatically full graphs, Covering all cliques of a graph, Trees with 1-factors and oriented trees, Stable properties of graphs, Self complementary topologies and preorders, Nimhoff games, Optimal covering of cacti by vertex-disjoint paths, Maximum \((g,f)\)-factors of a general graph, Lower Ramsey numbers for graphs, Constructible hypergraphs, A tree representation for \(P_ 4\)-sparse graphs, Algorithms for generating labelled graphs with given degree, Graph properties and hypergraph colourings, On forcibly connected graphic sequences, On packing and covering numbers of graphs, Connection-trap-free database schemes, Processor-time tradeoffs in PRAM simulations, Short proofs of Khintchine-type inequalities for zero-one matrices, Distances in random plane-oriented recursive trees, Rado's Selection Principle: Applications to binary relations, graph and hypergraph colorings and partially ordered sets, A \((\Delta / 2)\)-approximation algorithm for the maximum independent set problem, Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets, Coflow polyhedra, Indecomposable regular graphs and hypergraphs, The chromatic index of a graph whose core has maximum degree two, Minimum loss scheduling problems, On the routing problem in faulty supercubes, Forwarding indices of \(k\)-connected graphs, Nonblocking self-routing switching networks, Super edge-connectivity of dense digraphs and graphs, Compositions in the bipartite subgraph polytope, Contributions to the theory of graphic sequences, Integral matrices with given row and column sums, Pattern associativity and the retrieval of semantic networks, A computational procedure for part design, A parallel algorithm for approximating the minimum cycle cover, On the existence of kernels and \(h\)-kernels in directed graphs, Stability number of bull- and chair-free graphs, Studies on hypergraphs. I: Hyperforests, On pseudounimodular matrices, Inequalities with respect to graph homomorphism, Hamiltonian paths in oriented graphs, A note on a paper by D. Seinsche, On maximal circuits in directed graphs, On defect-d matchings in graphs, Pairs of Hamiltonian circuits in 5-connected planar graphs, Distances in orientations of graphs, Covers, matchings and odd cycles of a graph, An extension of bipartite multigraphs, Some properties of Chebyshev approximation in a subspace of \(R^n\), On tangential 2-blocks, On the ratio of optimal integral and fractional covers, Some partitions associated with a partially ordered set, Acyclic orientations of a graph and the chromatic and independence numbers, A method in graph theory, On hypergraphs without significant cycles, On two minimax theorems in graph, On small graphs critical with respect to edge colourings, Decomposition of the complete directed graph into k-circuits, A lower bound for the circumference of a graph, Comparability graphs and a new matroid, Some remarks on E- minimal graphs, Graph-theoretic properties in computational complexity, Convex polyhedra of doubly stochastic matrices. I: Applications of the permanent function, Non-Hamiltonian non-Grinbergian graphs, Interval hypergraphs and D-interval hypergraphs, A set-theoretical approach to the problem of hierarchical clustering, A Boolean matrix iteration in timetable construction, t-designs on hypergraphs, Circuits containing specified edges, On kernel-perfect critical digraphs, Hamiltonian decompositions of complete regular s-partite graphs, Intersection graphs of paths in a tree, Combinatorial verification of the elementary divisors of tensor products, A linear algorithm for finding a minimum dominating set in a cactus, Unimodular functions, On k-leaf-connected graphs, Minimally 3-connected graphs, Neighborhood perfect graphs, On k-optimum dipath partitions and partial k-colourings of acyclic digraphs, The complexity of central slice functions, New classes of perfect graphs, Structure and recognition of domishold graphs, The edge-chromatic class of regular graphs of degree 4 and their complements, Line-closed combinatorial geometries, A counterexample to a generalization of Richardson's theorem, Extremal problems concerning transformations of the set of edges of the complete graph, General forbidden configuration theorems, The generalized Sprague-Grundy function and its invariance under certain mappings, Covering with Euclidean boxes, Biregular subgraphs of biregular graphs, Hamiltonian circuits in interval graph generalizations, Structural analysis of local search heuristics in combinatorial optimization, Random hypergraphs and topological gelation criterion for crosslinked polymer systems, Separation and lower bounds for ROM and nondeterministic models of parallel computation, On finding the bidimension of a relation, Finding a homotopy base for directed paths in an acyclic graph, A new look at fault-tolerant network routing, On domination problems for permutation and other graphs, On 2k-twisted graphs, Efficient parallel simulations of dynamic Ising spin systems, On bounds for a board covering problem, Representative graphs of r-regular partial planes and representation of orthomodular posets, Strong unimodularity for matrices and hypergraphs, Extreme points for positive forms on \(\ell ^ p\), Totally balanced and totally unimodular matrices defined by center location problems, On common edges in optimal solutions to traveling salesman and other optimization problems, Epidemiography. II: Games with a dozing yet winning player, Decompositions of hypergraphs into hyperstars, On the number of regular configurations, A polynomial characterization of some graph partitioning problems, The vertex picking game and a variation of the game of dots and boxes, On the desirability of \(\gamma\)-acyclic BCNF database schemes, Two classes of perfect graphs, INGRID: A graph invariant manipulator, On hypergraph acyclicity and graph chordality, Interpolation between bases and the shuffle exchange network, Finite function spaces and measures on hypergraphs, Positive sets in finite linear function spaces, A note on odd/even cycles, Inequalities between the domination number and the chromatic number of a graph, Star-cutsets and perfect graphs, On the core of a traveling salesman cost allocation game, Fault-tolerant routings in Kautz and de Bruijn networks, On decomposition of hypergraphs into \(\Delta\)-systems, Perfect graphs are kernel solvable, Graphical properties related to minimal imperfection, Lower bounds on the cardinality of the maximum matchings of planar graphs, Regular and canonical colorings, F-factors of graphs: A generalized matching problem, CPO's of measures for nondeterminism, On the inverse M-matrix problem for (0,1)-matrices, An interconnection of local maps inducing onto global maps, The node-deletion problem for hereditary properties is NP-complete, A combinatorial optimization problem: optimal generalized cycle bases, A property of a-fragments of a digraph, On regular graphs and Hamiltonian circuits, including answers to some questions of Joseph Zaks, The diagonal hypergraph of a matrix (bipartite graph), On the maximum number of edges in a hypergraph whose linegraph contains no cycle, Partition theorems for unary algebras, Negation can be exponentially powerful, Critical graphs for chromatic difference sequences, Matroid matching and some applications, Forbidden configurations in intersection graphs of r-graphs, Geography, games and graphs, f-factors and related decompositions of graphs, Defect-d matchings in graphs with cyclomatic numbers 0,1 and 2, Critical hypergraphs for the weak chromatic number, Consanguinity graphs, On Petersen's graph theorem, Remarks on the requirement matrix of school timetable problems and regular embeddings of graphs, Even polyhedral decompositions of cubic graphs, Matrices with isomorphic diagonal hypergraphs, Affinely totally variant subsets of \(V_ 3(\)GF(3)), Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k, Oriented hypergraphs, stability numbers and chromatic numbers, On the maximum matchings of regular multigraphs, The direct power of a 1-graph, On the maximum number of diagonals of a circuit in a graph, A problem of Ulam on planar graphs, Adjacent vertices on the b-matching polyhedron, Note sur la non existence d'un snark d'ordre 16, On the arc-chromatic number of a digraph, Cycles in strong oriented graphs, Amalgamation of matroids and its applications, Complexity of representation of graphs by set systems, On the connectivity of a network, Applications of an inequality in information theory to matrices, Some sequences associated with combinatorial structures, On determination of graph G whose bond lattice \({\mathcal L}(G)\) is modular, Medians for weight metrics in the covering graphs of semilattices, A graph approximation heuristic for the vertex cover problem on planar graphs, Optimal distributed execution of join queries, A review of combinatorial problems arising in feedforward neural network design, Complexity of the hamiltonian cycle in regular graph problem, New classes of Berge perfect graphs, On fault-tolerant fixed routing in hypercubes, Two edge-disjoint hamiltonian cycles in the butterfly graph, Hamilton decompositions of complete 3-uniform hypergraphs, Dependence systems with the operator-image exchange property, Incorporating processor costs in optimizing the distributed execution of join queries, On the equivalence of constrained and unconstrained flows, On an optimization problem occurring in FMSs: A hypergraph-theoretical formulation, On asymmetric \((0,1)\)-matrices with given row and column sum vectors, On an approximation measure founded on the links between optimization and polynomial approximation theory, On fault-tolerant embedding of Hamiltonian circuits in line digraph interconnection networks, The NP-completeness of chromatic index in triangle free graphs with maximum vertex of degree 3, Fractional v. integral covers in hypergraphs of bounded edge size, The diversity of domination, Line hypergraphs, Domination and irredundance in cubic graphs, Efficiency and effectiveness of normal schedules on three dedicated processors, On \((k,l)\)-kernels in generalized products, One-node cutsets and the dominating set polytope, On transversals in minimal imperfect graphs, Splitting trees, A nice class for the vertex packing problem, Preassignment requirements in chromatic scheduling, On the use of Boolean methods for the computation of the stability number, Vertex-splitting and chromatic index critical graphs, Open shop problem with zero-one time operations and integer release date/deadline intervals, Trees, taxonomy, and strongly compatible multi-state characters, Exploiting storage redundancy to speed up randomized shared memory simulations, A bibliography on chromatic polynomials, A note on 1-factors in certain regular multigraphs, Disjoint independent dominating sets in graphs, Analyzing games by Boolean matrix iteration, Line graphs of hypergraphs. I, Covering the vertex set of a graph with subgraphs of smaller degree, Matroidal graphs, On the truncated assignment polytope, Multigraphs with quasiweak odd cycles, On additive partitions of integers, The matroids with the max-flow min-cut property, Extremal graphs with prescribed covering number, Hypergraph models for the circuit layout problem, Algorithms on clique separable graphs, Infinite triangulated graphs, An edge-coloration theorem for bipartite graphs with applications, The length of a (0,1) matrix, Trivially perfect graphs, Matroids from directed graphs, Covering digraphs by paths, Spanning cycles of nearly cubic graphs, Two-person games on graphs, Regularisable graphs I, Large-scale problem analysis and decomposition theory, Flows on graphs applied to diagonal similarity and diagonal equivalence for matrices, Coverings by minimal transversals, On a class of balanced hypergraphs, Median graphs and Helly hypergraphs, Perfectness of normal products of graphs, Le nombre minimal de colorations d'un hypergraphe k-chromatique, A note on hypergraphs with the Helly-property, On the sum of cardinalities of extremum maximal independent sets, Minimum node disjoint path covering for circular-arc graphs, Upper and lower bounds for graph-diameter problems with application to Record allocation, On the cyclomatic number of a hypergraph, On matroidal families, The edge-coloring of complete hypergraphs. I, Induced matchings, Chromatic partitions of a graph, Average distances in undirected graphs and the removal of vertices, On winning strategies in Ehrenfeucht-Fraïssé games, A characterization of signed hypergraphs and its applications to VLSI via minimization and logic synthesis, Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach, A generalization of König-Egervary graphs and heuristics for the maximum independent set problem with improved approximation ratios, What is my objective function?, On the algorithmic complexity of twelve covering and independence parameters of graphs, On minimal imperfect graphs without induced \(P_5\), On the odd cycles of normal graphs, The realization graph of a degree sequence with majorization gap 1 is Hamiltonian, Pseudo-chordal mixed hypergraphs, Totally critical even order graphs, Matrix sandwich problems, The complexity of finding a second Hamiltonian cycle in cubic graphs, Some special realizations of partition matrix sequences, A new optimal algorithm for backbone topology design in communications networks, Spanning properties for fuzzy matroids, Fuzzy Mason graphs, Efficient edge domination problems in graphs, Rearrangeable nonblocking condition for multi-log\(_ 2 N\) multiconnection networks, Stable sets and polynomials, Normal fraternally orientable graphs satisfy the strong perfect graph conjecture, \(F\)-decomposable social aggregation rules and acyclic choice, Norms on terms and their use in proving universal termination of a logic program, Decomposing constraint satisfaction problems using database techniques, Polyominos and perfect graphs, A sufficient condition for equitable edge-colourings of simple graphs, Degree sequences and majorization, 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, Rearrangeability of bit permutation networks, Networks beyond pairwise interactions: structure and dynamics, Depth of nodes in random recursive \(k\)-ary trees, On the number of broadcast schemes in networks, Coloring some classes of mixed graphs, Tangent circle graphs and `orders', Potentially \(K_{r_{1},r_{2},\dots ,r_{l},r,s}\)-graphic sequences, On chromaticity of hypergraphs, A method of finding automorphism groups of endomorphism monoids of relational systems., Harary index and some Hamiltonian properties of graphs, Growth problems for avoidable words, A data structure useful for finding Hamiltonian cycles, A distributed synchronization scheme for fair multi-process handshakes, A parallel algorithm for eliminating cycles in undirected graphs, Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs, Dynamic maintenance of directed hypergraphs, On the complexity of algorithms on recursive trees, A universal table model for categorical databases, A logic-based analysis of Dempster-Shafer theory, An algebra of probability over finite product spaces, with applications, Incomparability in parallel computation, Minimizing the number of tardy job units under release time constraints, Circular balanced uniform repeated measurements designs. II, Lifting facets of the cut polytope, Approximability results for the maximum and minimum maximal induced matching problems, Self-duality of bounded monotone Boolean functions and related problems, A tutorial on the use of graph coloring for some problems in robotics, On 2-factors with \(k\) components, The 0-1 inverse maximum stable set problem, A short constructive proof of the Erdős-Gallai characterization of graphic lists, On the complexity of recognizing directed path families, Bounds and conjectures for the signless Laplacian index of graphs, On handshakes in random graphs, Minimum sum edge colorings of multicycles, Approximation of min coloring by moderately exponential algorithms, A note on \(t\)-complementing permutations for graphs, Making choices with a binary relation: relative choice axioms and transitive closures, Distributing vertices along a Hamiltonian cycle in Dirac graphs, The intersection of all maximum stable sets of a tree and its pendant vertices, Equivalences and the complete hierarchy of intersection graphs of paths in a tree, On the inapproximability of independent domination in \(2P_3\)-free perfect graphs, Milne's volume function and vector symmetric polynomials, Using stable sets to bound the chromatic number, Efficient approximation of Min Set Cover by moderately exponential algorithms, The galaxies of nonstandard enlargements of infinite and transfinite graphs, A fast parallel algorithm for finding Hamiltonian cycles in dense graphs, Some results on \((a:b)\)-choosability, Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs, Intersection models of weakly chordal graphs, Inducing regulation of any digraphs, Weighted coloring on planar, bipartite and split graphs: Complexity and approximation, Computational properties of argument systems satisfying graph-theoretic constraints, A notion of cross-perfect bipartite graphs, Linear connectivity problems in directed hypergraphs, Variable neighborhood search for extremal graphs. 23. On the Randić index and the chromatic number, Linear-time certifying algorithms for near-graphical sequences, Weighted coloring: further complexity and approximability results, An adjustable linear time parallel algorithm for maximum weight bipartite matching, On intersection multigraphs of hypergraphs, Unidigraphic and unigraphic degree sequences through uniquely realizable integer-pair sequences, Partition of odd regular graphs into bistars, Perfectness and Dilworth number, Properties of (0,1)-matrices with no triangles, A class of matroids derived from saturated chain partitions of partially ordered sets, On matroids of the greatest W-connectivity, Ensemble convexes dans les graphes. I: Théoremes de Helly et de Radon pour graphes et surfaces, On realizable biorders and the biorder dimension of a relation, About some cyclic properties in digraphs, Long cycles in bipartite graphs, Matrices with forbidden subconfigurations, On the existence of acyclic views in a database scheme, Edge and vertex intersection of paths in a tree, Covering and coloring problems for relatives of intervals, The complexity of facets (and some facets of complexity), On the chromatic number of certain highly symmetric graphs, Decomposition by clique separators, Shortest coverings of graphs with cycles, Clique graphs and Helly graphs, Perfectly contractile graphs, On Ringeisen's isolation game. II, A two-stage approach for large-scale sewer systems design with application to the Lake Balaton resort area, A note on total domination, A deletion game on hypergraphs, On the existence of (k,\(\ell)\)-kernels in digraphs, A note about a theorem by Maamoun on decompositions of digraphs into elementary directed paths or cycles, A characterization of totally balanced hypergraphs, Dominating sets and domatic number of circular arc graphs, On total functions, existence theorems and computational complexity, Structural consequences of individual position in nondyadic social networks, Good coverings of Hamming spaces with spheres, Orientations of graphs in kernel theory, On graphic and 3-hypergraphic sequences, Packings by cliques and by finite families of graphs, Every poset has a central element, A note on finding minimum cuts in directed planar networks by parallel computations, Vicinal orders of trees, Uniquely solvable quadratic Boolean equations, Properties of optimal survivable paths in a graph, Two party immediate response disputes: Properties and efficiency, \((p,k)\)-coloring problems in line graphs, The first Zagreb index, reciprocal degree distance and Hamiltonian-connectedness of graphs, Modeling one-mode projection of bipartite networks by tagging vertex information, A variation of a classical Turán-type extremal problem, Colouring the normalized Laplacian, Cluster graph modification problems, Note on structural properties of graphs, Approximate constrained bipartite edge coloring, Universal Tutte polynomial, Exploring the dynamic growth mechanism of social networks using evolutionary hypergraph, Emergence of scaling in evolving hypernetworks, Principal eigenvectors and spectral radii of uniform hypergraphs, Integral bases and \(p\)-twisted digraphs, An algebraic analysis of the connectivity of De Bruijn and shuffle- exchange digraphs, Edge deletion preserving the diameter of the hypercube, The largest transversal numbers of uniform hypergraphs, Transversal partitioning in balanced hypergraphs, Extending matchings in planar graphs. V, The modelling of vibrating bar systems with nonlinear changeable sections of robots by means of hypergraphs and structural numbers, Efficient approximation algorithms for domatic partition and on-line coloring of circular arc graphs, Algorithmic aspects of the generalized clique-transversal problem on chordal graphs, On the structure of trapezoid graphs, On bounding the chromatic number of L-graphs, Using maximality and minimality conditions to construct inequality chains, The existence of uniquely \(-G\) colourable graphs, Hypergraphs and hypergroups, Interchange graphs and the Hamiltonian cycle polytope, On the two-connected planar spanning subgraph polytope, On monochromatic paths and monochromatic cycles in edge coloured tournaments, The complexity of generalized graph colorings, Finding regular subgraphs in both arbitrary and planar graphs, Incidence graphs of biacyclic hypergraphs, Characterizing and edge-colouring split-indifference graphs, Treelet kernel incorporating cyclic, stereo and inter pattern information in chemoinformatics, Graph algorithms for DNA sequencing -- origins, current models and the future, Classification of non-local rings with projective 3-zero-divisor hypergraph, Cycles in the cube-connected cycles graph, On certain polytopes associated with graphs, Classification of de Bruijn-based labeled digraphs, Partitioning the edge set of a bipartite graph into chain packings: Complexity of some variations, Greedy algorithms, \(H\)-colourings and a complexity-theoretic dichotomy., A Nim game played on graphs. II., Study of the variable growth hypernetworks influence on the scaling law, A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem, Efficient dominating sets in Cayley graphs., Clique family inequalities for the stable set polytope of quasi-line graphs., On the equality of the partial Grundy and upper ochromatic numbers of graphs, On maximum \(k\)-edge-colorable subgraphs of bipartite graphs, Sufficient conditions for Hamiltonian cycles in bipartite digraphs, Berge-acyclic multilinear 0-1 optimization problems, Orientations, lattice polytopes, and group arrangements. III: Cartesian product arrangements and applications to Tutte type polynomials, On the connection of hypergraph theory with formal concept analysis and rough set theory, Complexity of Grundy coloring and its variants, \(k\)-tuple colorings of the Cartesian product of graphs, Distance regularity of compositions of graphs., A hypocoloring model for batch scheduling, On-line vertex-covering, Polynomial approximation algorithms with performance guarantees: an introduction-by-example, Pricing traffic in a spanning network, Partially dynamic maintenance of minimum weight hyperpaths, Phase transition of random non-uniform hypergraphs, Locally guided randomized elections in trees: The totally fair case, The smallest spectral radius of bicyclic uniform hypergraphs with a given size, Matching and edge-connectivity in graphs with given maximum degree, Connected hypergraphs without long Berge-paths, Sufficient conditions for maximally edge-connected hypergraphs, Connected realizations of joint-degree matrices, Directed hypergraphs and applications, Some properties of a higher-order coboundary operator, Constraints in vision. Outline of a set-theoretic approach., Syntactic stochastic processes: definitions, models, and related inference problems, Minimum graphs of specified diameter, connectivity and valence. II, An upper bound for the transversal numbers of 4-uniform hypergraphs, Efficient algorithms for path partitions, On two intersecting set systems and k-continuous Boolean functions, A characterization of graphs with given maximum degree and smallest possible matching number. II, On kernels in i-triangulated graphs, Ramsey-Sperner theory, Kernels in some orientations of comparability graphs, Minimum number of elements of representing a set system of given rank, The star arboricity of graphs, Decomposition of balanced matrices, On some graph problem in the theory of partial algebras. I., The principal Erdős-Gallai differences of a degree sequence, On the irreducibility of a class of polynomials. III, On the NP-hardness of edge-deletion and -contraction problems, Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs, Algorithmic approach to the satisfactory graph partitioning problem, Partial monotonizations of Hamiltonian cycle polytopes: Dimensions and diameters, On a geometric combinatorial problem, Kernels in edge-colored digraphs, Matchings and matching extensions in graphs, Completeness for intersection classes, Graph colorings and related symmetric functions: ideas and applications: A description of results, interesting applications, and notable open problems., Some Ramsey nu mbers for directed graphs, Review of properties of different precedence graphs for scheduling problems, Extended capabilities for visual cryptography, On the number of precolouring extensions, One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture, Coloring face-hypergraphs of graphs on surfaces, High-order approximation rates for shallow neural networks with cosine and \(\mathrm{ReLU}^k\) activation functions, The first few unicyclic and bicyclic hypergraphs with largest spectral radii, On representatives of multi-index transportation problems, Quasiorthogonal dimension of Euclidean spaces, A faster parallel connectivity algorithm on cographs, Exploring the evolutionary mechanism of complex supply chain systems using evolving hypergraphs, Information spreading dynamics in hypernetworks, The largest set partitioned by a subfamily of a cover, Inversions, cuts, and orientations, On the set coincidence game, Improved worst-case complexity for the MIN 3-SET COVERING problem, A limit characterization for the number of spanning trees of graphs, Information dissemination in dynamic hypernetwork, Monochromatic Hamiltonian Berge-cycles in colored hypergraphs, Essential obstacles to Helly circular-arc graphs, The soccer game, bit by bit: an information-theoretic analysis, New characterizations of Gallai's \(i\)-triangulated graphs, The linear unicyclic hypergraph with the second or third largest spectral radius, Digital H-spaces and actions in the pointed digital homotopy category, The \(k\)-annihilating-ideal hypergraph of commutative ring, Sufficient conditions for graphs to be spanning connected, Domination chain: characterisation, classical complexity, parameterised complexity and approximability, Equitable coloring of hypergraphs, On some graph classes related to perfect graphs: a survey, On the facets of stable set polytopes of circular interval graphs, Refining the phase transition in combinatorial search, Long monochromatic paths and cycles in 2-colored bipartite graphs, Risk propagation and evolution analysis of multi-level handlings at automated terminals based on double-layer dynamic network model, Reducing hypergraph coloring to clique search, On partial cubes, well-graded families and their duals with some applications in graphs, Distance problems within Helly graphs and \(k\)-Helly graphs, Duality of graph invariants, The digital Hopf construction, Computing partial hypergraphs of bounded width, Concepts on coloring of cluster hypergraphs with application, Matrix graphs and MRD codes over finite principal ideal rings, On the generalized Helly property of hypergraphs, cliques, and bicliques, Disjunctive total domination in permutation graphs, Finding the \(K\) best policies in a finite-horizon Markov decision process, On an adjacency property of almost all tournaments, Odd cycles and \(\Theta\)-cycles in hypergraphs, Good and nice colorings of balanced hypergraphs, The \(k\)-maximal hypergraph of commutative rings, Degree sequence conditions for a graph to be disjoint path coverable, Dynamical analysis of Hyper-SIR rumor spreading model, Approximation of set multi-cover via hypergraph matching, Counting spanning trees using modular decomposition, Edge-coloring almost bipartite multigraphs, Boolean functions with long prime implicants, Equality of domination and transversal numbers in hypergraphs, 2-clique-bond of stable set polyhedra, Characterization of classical graph classes by weighted clique graphs, On cyclic Hamiltonian decompositions of complete \(k\)-uniform hypergraphs, On dominating pair degree conditions for Hamiltonicity in balanced bipartite digraphs, A characterization of partial directed line graphs, Decompositions of complete 3-uniform hypergraphs into cycles of constant prime length, Decomposition of structural learning about directed acyclic graphs, Stable set and clique polytopes of \((P_{5},\,\mathrm{gem})\)-free graphs, Characterization and recognition of generalized clique-Helly graphs, Uniform forcing and immune sets in graphs and hypergraphs, A polynomial time equivalence between DNA sequencing and the exact perfect matching problem, Ideals and graphs, Gröbner bases and decision procedures in graphs, The \(k\)-edge intersection graphs of paths in a tree, A comparative analysis of multidimensional features of objects resembling sets of graphs, Generalized pattern extraction from concept lattices, On bags and bugs, Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs, A sufficient condition for the bicolorability of a hypergraph, Competition-reachability of a graph, A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2, The Hamiltonian problem on distance-hereditary graphs, Time-stamps for Mazurkiewicz traces., Applications of Ramsey theory, Compositions for perfect graphs, Circular mixed hypergraphs. II: The upper chromatic number, On the oriented chromatic number of graphs with given excess, Construction for bicritical graphs and \(k\)-extendable bipartite graphs, Hypergraphs induced by algebras of fixed type, Recognizing Helly edge-path-tree graphs and their clique graphs, Dynamical modeling and analysis of large cellular regulatory networks, A contract-based model for directed network formation, On the genus of the \(k\)-annihilating-ideal hypergraph of commutative rings, The flow and tension spaces and lattices of signed graphs, Non-finitely axiomatisable modal product logics with infinite canonical axiomatisations, Brand effect versus competitiveness in hypernetworks, Sufficient conditions for Hamilton-connected graphs in terms of (signless Laplacian) spectral radius, Extremality of graph entropy based on degrees of uniform hypergraphs with few edges, Spectra of cycle and path families of oriented hypergraphs, String graphs of k-bend paths on a grid, Homology of path complexes and hypergraphs, Sequentially compatible payoffs and the core in TU-games, Sufficient conditions for hypergraphs to be maximally edge-connected, The Measures of Rank or Status: A Reformulation and Reinterpretation, Construction of sports schedules with multiple venues, Locally restricted colorings, A New Characterisation of Connected Hypergraphs, Domination in Semigraphs, P-antiregular graphs, Efficient recognition of equimatchable graphs, On the Galois lattice of bipartite distance hereditary graphs, Three-arc graphs: characterization and domination, On the Algorithmic Complexity of Total Domination, The independent domination numbers of strong product of two cycles, Unnamed Item, On some non-obvious connections between graphs and unary partial algebras, An Application of Arc-Reaching Sets in Social-Network Analysis, Ideal based hypergraph of a commutative ring, Cutsets in bipartite graphs*, Maximizing the number of spanning trees on the (p,p+2) graphs, The projective 3-annihilating-ideal hypergraphs, A tutorial on graph models for scheduling round‐robin sports tournaments, Odd Solutions to Systems of Inequalities Coming From Regular Chain Groups, Deep graphs—A general framework to represent and analyze heterogeneous complex systems across scales, Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs, Fuzzy logic programs as hypergraphs. Termination results, Chromatic Edge Strength of Some Multigraphs, Online Bounded Coloring of Permutation and Overlap Graphs, Portfolio optimization through a network approach: network assortative mixing and portfolio diversification, Spectrum of the 3-zero-divisor Hypergraph of Some Classes of Local Rings, A note on bounds for the broadcast domination number of graphs, The iterated local transitivity model for hypergraphs, The two-step average tree value for graph and hypergraph games, Study on information transmission model of enterprise informal organizations based on the hypernetwork, Unnamed Item, Unnamed Item, Nonnegative tensors revisited: plane stochastic tensors, Unnamed Item, Strongly set-colorable graphs, On the genus of the k-maximal hypergraph of commutative rings, When polynomial approximation meets exact computation, Difference graphs, Independent point-set dominating sets in graphs, When polynomial approximation meets exact computation, Polar cographs, Polar cographs, The covering radius of doubled 2-designs in \(2O_ k\), On signed digraphs with all cycles negative, Irregularity strength of dense graphs, A Digital Version of the Kakutani Fixed Point Theorem for Convex-valued Multifunctions, Independence numbers of product graphs, Unnamed Item, Using Cellular Automata on a Graph to Model the Exchanges of Cash and Goods, Dynamic algorithms for classes of constraint satisfaction problems, Edge coloring of bipartite graphs with constraints, A priori optimization for the probabilistic maximum independent set problem, Sparse and limited wavelength conversion in all-optical tree networks, The cost of edge removal in graph domination, Determining the robustness of an interdependent network with a hypergraph model, α-Derivable digraphs and its application in wireless sensor networking, Weakly coupled Gibbs measures, Chromatic polynomials of hypergraphs, Unnamed Item, Unnamed Item, The variety of primitive representations of a quiver with normal relations, On scores, losing scores and total scores in hypertournaments, A new characterization of trivially perfect graphs, To reorient is easier than to orient: An on-line algorithm for reorientation of graphs, On k-chromatically unique and k-chromatically equivalent hypergraphs, On chromatic polynomials of hypergraphs, On hyper-Zagreb index conditions for hamiltonicity of graphs, Generalized s-distance colourings of a hypergraph
