scientific article

zbMath0105.35401MaRDI QIDQ3291034

Øystein Ore

Publication date: 1962

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

topology

Related Items

Graphs having distance-\(n\) domination number half their order, An upper bound for the minimum number of queens covering the \(n {\times} n\) chessboard, On graphs with equal domination and covering numbers, Intersection graphs of concatenable subtrees of graphs, On infinite graphs with a primitive automorphism group, Generalized dimension of an ordered set and its MacNeille completion, On the chromatic number of the lexicographic product and the Cartesian sum of graphs, A note on co-maximal graphs of commutative rings, The diversity of domination, Efficient location of resources in cylindrical networks, A non-covering graph of girth six, Dominating sets in social network graphs, Degree sum conditions on two disjoint cycles in graphs, Covering posets, Bigeodetic graphs, Domination and upper domination of direct product graphs, Upper bound on 3-rainbow domination in graphs with minimum degree 2, A certain combinatorial inequality, The Menger-like property of the three-width of infinite graphs, The \(k\)-ball \(l\)-path branch weight centroid, Structural conditions for cycle completable graphs, ZAPROS-LM -- a method and system for ordering multiattribute alternatives, Inequalities for the chromatic numbers of graphs, A note on Menger's theorem for infinite locally finite graphs, Symmetries of directed graphs and the chinese remainder theorem, The probabilistic minimum dominating set problem, Arbitrarily traceable graphs and digraphs, On maximal independent sets of vertices in claw-free graphs, Hamiltonian isomorphism of graphs, Structural aspects of controllability and observability. II: Digraph decomposition, Complexity of dimension three and some related edge-covering characteristics of graphs, On upper bounds for the independent transversal domination number, Strong resolving graphs: the realization and the characterization problems, The Redei function of a relation, Domination in commuting graph and its complement, A generalization of Turan's theorem, Stratification and domination in graphs, Ferrers digraphs and threshold graphs, On the Ferrers dimension of a digraph, The common structure graph: Common structural features of a set of graphs, Some general constructions of geodetic blocks, Representation of proofs by colored graphs and the Hadwiger conjecture, Partition conditions and vertex-connectivity of graphs, Principle of inclusion-exclusion on partially ordered sets, Some asymptotic ith Ramsey numbers, A new generalisation of graph theory, Maximum number of edges in connected graphs with a given domination number, Some properties of graph centroids, Knowledge representation for mathematical discovery: Three experiments in graph theory, Galois connections between subgroup lattices and module lattices, On the \(r\)-domination number of a graph, A graph-theoretic proof of arrow's dictator theorem, On the nonsingular submatrices of the incidence matrix of a graph over the real field, Redundant networks and minimum distance, Coverings of transfinite matrices, On the free matrix representation of transversal geometries, Numero cromatico, omomorfismi e colorazioni d'ungrafo, The Chartrand-Schuster conjecture: Graphs with unique distance trees are regular, Structure of vertex-transitive graphs, On elementary theories of graphs and Abelian loops, The effect of cross reactivity on immunological reaction matrices, Some applications of graph theory to clustering, Some path problems in graph theory, Dictators on blocks: Generalizations of social choice impossibility theorems, Processi di Markoff del primo ordine derivanti da processi di Markoff di ordine superiore, Acyclic orientations of a graph and the chromatic and independence numbers, Pairs of edge-disjoint Hamiltonian circuits, Minimum block containing a given graph, S-functions for graphs, Properties of a Euler graph, An \(R^d\) analogue of Valentine's theorem on 3-convex sets, On the structure of infinite vertex-transitive graphs, A first family of edge-critical wheels, A note on \(P(-\lambda;G)\), Matroids from directed graphs, A simple proof of the Galvin-Ramsey property of the class of all finite graphs and a dimension of a graph, Connectedness and classification of certain graphs, Mengerian theorems for paths of bounded length, On the sum of cardinalities of extremum maximal independent sets, Probabilities of homomorphic mappings from multiple graphs, Median graphs and tree analysis of dichotomous data, an approach to qualitative factor analysis, The even adjacency split problem for graphs, Quasi-Hamiltonicity: A series of necessary conditions for a digraph to be Hamiltonian, The influence of special vertices on strong domination, A general extension theorem for binary relations, Domination number and neighbourhood conditions, Characterization of graphs with equal domination and covering number, Generalized independence and domination in graphs, A link between Menger's theorem and infinite Euler graphs, Every triangle-free planar graph has a planar upward drawing, The dynamics of the line and path graph operators, Efficient edge domination problems in graphs, The sequence of upper and lower domination, independence and irredundance numbers of a graph, On the Dedekind-MacNeille closure of an ordered set and a theorem of Novák, Spherical containment and the Minkowski dimension of partial orders, Interval dimension and MacNeille completion, The dimension of orthomodular posets constructed by pasting Boolean algebras, On the complexity of diagram testing, The domatic number problem, Interval choice: Classic and general cases, A sufficient condition for oriented graphs to be Hamiltonian, Bounds on the domination number and the metric dimension of co-normal product of graphs, The domination number and the least \(Q\)-eigenvalue, Transferable domination number of graphs, Improved upper bounds on the domination number of graphs with minimum degree at least five, Conditions for universal reducibility of a two-stage extremization problem to a one-stage problem, Edge criticality in graph domination, The difference between the metric dimension and the determining number of a graph, Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph, Domination number in graphs with minimum degree two, Characterization of diagrams by 0-1 inequalities, Galois theory for clones and superclones, Infimal generators and dualities between complete lattices, Isolation in graphs, Amenable group actions on infinite graphs, Double Roman domination, Optimal broadcast domination in polynomial time, Minimizing the Laplacian eigenvalues for trees with given domination number, On the outer-connected domination in graphs, A construction of geodetic graphs based on pulling subgraphs homeomorphic to complete graphs, On strong (weak) independent sets and vertex coverings of a graph, Matroids and linking systems, Matchings and transversals in hypergraphs, domination and independence in trees, Critical sets in bipartite graphs, Normal extensions escape from the class of weighted shifts on directed trees, The complexity of embedding orders into small products of chains, Restricted domination in graphs with minimum degree 2, Dominating direct products of graphs, Graphs with disjoint dominating and paired-dominating sets, Bounds on the \(k\)-dimension of products of special posets, Rainbow edge-coloring and rainbow domination, Domination versus independent domination in cubic graphs, Trees as level sets for pseudoharmonic functions in the plane, Domination in 4-regular graphs with girth 3, ILIGRA: an efficient inverse line graph algorithm, A note on 3-Steiner intervals and betweenness, Minimal energies of trees with given parameters, Domination number and Laplacian eigenvalue distribution, The decomposition tree of a biconnected graph, Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack, Estimations for the domination number of a graph, Graphs with constant sum of domination and inverse domination numbers, Some upper bounds related with domination number, Structural theory of space-time and intrapoint symmetry, Towards a new framework for domination, Dominating and total dominating partitions in cubic graphs, Domination number of graphs without small cycles, Dominator colorings in some classes of graphs, \(k\)-domination and \(k\)-independence in graphs: A survey, On extremal Zagreb indices of trees with given domination number, Permanental bounds of the Laplacian matrix of trees with given domination number, Facet defining inequalities among graph invariants: The system graphedron, A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets, Characterizing minimal point set dominating sets, Partially normal composition operators relevant to weighted directed trees, On the domination number of Hamiltonian graphs with minimum degree six, The \(L(2,1)\)-labeling on Cartesian sum of graphs, The \(k\)-rainbow reinforcement numbers in graphs, Diameter bounded equal measure partitions of Ahlfors regular metric measure spaces, On subgraphs in distance-regular graphs, A note on graphs which have upper irredundance equal to independence, Statistical physics of vaccination, Exact algorithms for minimum weighted dominating induced matching, Bounds relating generalized domination parameters, Two strongly polynomial cut cancelling algorithms for minimum cost network flow, Networks of common property resources, Extremal energies of trees with a given domination number, Bounds of Laplacian spectrum of graphs based on the domination number, Lower bounds on the differential of a graph, Structural and algorithmic properties for parametric minimum cuts, Coloring the Cartesian sum of graphs, Domination in bipartite graphs, Bipartite toughness and \(k\)-factors in bipartite graphs, Bounds on weak Roman and 2-rainbow domination numbers, The minimum genus of a two-point universal graph, Minimum degree of bipartite graphs and the existence of k-factors, On the domination number of generalized petersen graphs \(P(n,2)\), On the ratios between packing and domination parameters of a graph, Path lengths and initial derivatives in arbitrary and Hessenberg compartmental systems, Geodetic blocks of diameter three, Matching relations and the dimensional structure of social choices, The minimum spectral radius of graphs with a given independence number, Domination and location in twin-free digraphs, A \(\frac{3}{4}\)-approximation of Vizing's conjecture for claw-free graphs, More on limited packings in graphs, An Ore-type condition for the existence of two disjoint cycles, On concrete characterization problem of endomorphism semigroups of graphs, Modal logics of domains on the real plane, Representation of functional dependencies in relational databases using linear graphs, On realizable biorders and the biorder dimension of a relation, Graph isomorphism problem, Relations between parameters of a graph, A Chvátal-Erdős condition for (t,t)-factors in digraphs using given arcs, What is the difference between the domination and independent domination numbers of a cubic graph?, Geodetic graphs of diameter two and some related structures, Whitney's theorem for infinite graphs, Conjugaison par tranches, Some properties of commutation in free partially commutative monoids, A Chvátal-Erdős condition for (1,1)-factors in digraphs, Point algebras for temporal reasoning: Algorithms and complexity, Global properties of a class of overdetermined systems., A new approach on locally checkable problems, The size of graphs with given feedback vertex number, Computational aspects of the 2-dimension of partially ordered sets, On symmetric division deg index of trees with given parameters, Isolation of the diamond graph, Isolation of \(k\)-cliques. II, Domination in fuzzy incidence graphs based on valid edges, Error-tolerant ZZW-construction, Interval orders based on arbitrary ordered sets, Bounds on domination parameters in graphs: a brief survey, On relatively elementary definability of graph classes in the class of semigroups, The complexity of cover graph recognition for some varieties of finite lattices, Infinite \(\Phi\)-periodic graphs, Decreasing the maximum degree of a graph, A polynomial-time approximation to a minimum dominating set in a graph, Dimension of fuzzy ordered sets, Detection of rotational and involutional symmetries and congruity of polyhedra, A subnormal completion problem for weighted shifts on directed trees. II, Total forcing sets and zero forcing sets in trees, Feynman integrals of \(p\)-adic argument in the momentum space. II: Explicit expressions, Matrices with elements from a division ring, Pairs of disjoint dominating sets in connected cubic graphs, Isolation of \(k\)-cliques, Minimum statuses of connected graphs with fixed maximum degree and order, Generalized flowers in \(k\)-connected graphs, The structure of a decomposition of a triconnected graph, On lower bounds on the spectrum of a binary code, Which graphs occur as \(\gamma\)-graphs?, Partitioning vertices into in- and out-dominating sets in digraphs, A note on domination and total domination in prisms, Domination on hyperbolic graphs, \(E=I+T\): the internal extent formula for compacted tries, Edge-grafting transformations on the average eccentricity of graphs and their applications, On distance spectral radius of graphs, On bondage numbers of graphs: a survey with some comments, Pairs of disjoint dominating sets and the minimum degree of graphs, On the \(b\)-domatic number of graphs, Schedulability analysis for strictly periodic tasks in RTOS, Proofs of the AutoGraphiX conjectures on the domination number, average eccentricity and proximity, Rigid interfaces for lattice models at low temperatures., A subnormal completion problem for weighted shifts on directed trees, Open-closed modular operads, the cardy condition and string field theory, Sufficient conditions for Hamiltonian cycles in bipartite digraphs, General upper bounds on independent \(k\)-rainbow domination, Gromov hyperbolicity in the Cartesian sum of graphs, Online dominating set, New parameter of inverse domination in graphs, Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes, Tropical dominating sets in vertex-coloured graphs, Infinite graphical Frobenius representations, Constrained domatic bipartition on trees, A minimal nonfinitely based semigroup whose variety is polynomially recognizable., The subalgebra lattice of a finite algebra, Bounds on the connected forcing number of a graph, Schrödinger operators on periodic discrete graphs, The least eigenvalue of a graph with a given domination number, On the strong metric dimension of the strong products of graphs, The \(v\)-number of edge ideals, The least \(Q\)-eigenvalue with fixed domination number, Star partitions on graphs, On the extremal values of the eccentric distance sum of trees with a given domination number, Checking quasi-identities in a finite semigroup may be computationally hard., A theory of recursive dimension of ordered sets, Immanantal invariants of graphs, Resolving dominating partitions in graphs, Exact and heuristic algorithms for the weighted total domination problem, On 3-regular digraphs of girth 4, A characterization of trees based on edge-deletion and its applications for domination-type invariants, Vertex disjoint cycles of different lengths in $d$-arc-dominated digraphs, Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares, The compared costs of domination location-domination and identification, Strong geodetic problem in networks, Bounding the \(k\)-rainbow total domination number, On the domination number of graphs with minimum degree six, Preservation of the classical meanness property of some graphs based on line graph operation, An exact solution framework for the minimum cost dominating tree problem, A continuous generalization of domination-like invariants, The domination number of round digraphs, The connectivities of locally finite primitive graphs, Domination-complete graphs, M-chain graphs of posets, Optimization of a recursive conveyor by reduction to a constraint satisfaction problem, Rewriting systems, plain groups, and geodetic graphs, A characterization of infinite planar primitive graphs, On some graph problem in the theory of partial algebras. I., Relating the size of a connected graph to its total and restricted domination numbers, On Sombor index of trees with fixed domination number, Finitely presented semigroups with nontrivial identities, Restrained Roman and restrained Italian domatic numbers of graphs, A formal model of atomicity in asynchronous systems, Dynamic Katz and related network measures, The number of edge 3-colorings of a planar cubic graph as a permanent, Geodetic orientations of complete \(k\)-partite graphs, Principle of inclusion-exclusion on semilattices, Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds, Independent domination of graphs with bounded maximum degree, Generalized reflection groups. II, Planar Manhattan local minimal and critical networks, Further results on packing related parameters in graphs, Succinct definitions in the first order theory of graphs, Dominating sets inducing large components, Dominating problems in swapped networks, Rainbow domination numbers on graphs with given radius, Inversions, cuts, and orientations, Relations between the Roman k-domination and Roman domination numbers in graphs, Über trennende Eckenmengen in Graphen und den Mengerschen Satz, Convergence of successive approximations in the shortest route problem, Unnamed Item, Domination number of graphs with minimum degree five, Minimal graphs with disjoint dominating and paired-dominating sets, Vertex-addition strategy for domination-like invariants, On the total and strong version for Roman dominating functions in graphs, On the structure of dominating graphs, Magnitude homology of enriched categories and metric spaces, New concepts in the vague graph structure with an application in transportation, Möbius stanchion systems, Betweenness centrality in Cartesian product of graphs, Geodesic geometry on graphs, Self-stabilizing algorithm for two disjoint minimal dominating sets, Finite-dimensional right alternative superalgebras with semisimple strongly alternative even part, On 2-Colorings of Hypergraphs, On \(\alpha\)-excellent graphs, Extremal graphs for a new upper bound on domination parameters in graphs, A tree labeling problem with an application to optimal approximation of continuous functions, Extremal values on the eccentric distance sum of trees, Multipartite tournaments: a survey, On the spectral radius of graphs with a given domination number, Domination in graphs of minimum degree at least two and large girth, A note on domination, girth and minimum degree, Domination in graphs of minimum degree five, Downhill domination in graphs, Outer independent double Roman domination, Strong geodetic cores and Cartesian product graphs, On vertex disjoint cycles of different lengths in 3-regular digraphs, Vertex-transitive graphs, Symmetric relations (undirected graphs) with given semigroups, Random matrices and graphs, Zu einem Isomorphiesatz von H. Whitney für Graphen, Omomorfismi fra grafi e grafi moltiplicativi, The trunk in the topology of electrical networks, The line analog of Ramsey numbers, Zur Klassifikation der endlichen Graphen nach H. Hadwiger und K. Wagner, Disjoint dominating and 2-dominating sets in graphs, Existence and structure of self-adjoint graphs, On Dehn's algorithm and the conjugacy problem, Bestimmung minimaler Wege in endlichen, gerichteten, bewerteten Graphen, Über eine kombinatorisch-geometrische Frage von Hadwiger und Debrunner, On a family of line-critical graphs, The connectivity of line-graphs, On Okada's method for realizing cut-set matrices, Untersuchungen über minimale \(n\)-fach zusammenhängende Graphen, Convexity in directed graphs, A problem on random trees, Another analog of Ramsey numbers, Composite measurement, Über den Baumgraphen eines endlichen ungerichteten Graphen, On the line-connectivity of line-graphs, Nerves of simplicial complexes, Some results on Kronecker, Dirichlet and Helson sets, Nucleo di una rete PERT e problema dei ritardi, Remark on the graphs with a central symmetry, Optimum flows in general communication networks, Climbing random trees, Ecken n-ten Grades in minimalen n-fach zusammenhängenden Graphen, Unendliche minimale \(n\)-fach zusammenhängende Graphen, On independent domination in planar cubic graphs, Une démonstration du théorème de Dilworth et applications à un problème de couverture des graphes, On the connectivity of total graphs, On repeated interchange graphs. II, Graphs with forbidden subgraphs, The uniqueness of a certain graph, Irreducible graphs, The number of idempotents in (0,1)-matrix semigroups, On the realizability of fundamental circuit matrices, 1-Faktoren von Graphen. (1-factors of graphs), Spectral stability of metric-measure Laplacians, Hamiltonian lines in infinite graphs with few vertices of smll valency, Description of some relations on the set of real-line intervals, On the planarity of regular incidence sequences, Irreducible graphs. II, A class of planar four-colorable graphs, On the automorphism group of a matroid, What if utility functions do not exist?, Normalformen planarer Graphen. II, Random packings and coverings in random trees, Compartmental matrices with single root and nonnegative nilpotent matrices, The reflection distance between zigzag persistence modules, Thickness and coarseness of graphs, On non-serial dynamic programming, Automorphisms and endomorphisms of infinite locally finite graphs, On the \(k\)-domination number of digraphs, The first order definability of graphs with separators via the Ehrenfeucht game, Metric-locating-dominating sets of graphs for constructing related subsets of vertices, Blocks in \(k\)-connected graphs, Broadcasts in graphs, On \(\bullet\)-line signed graphs \(L_\bullet(S)\), Locating-dominating sets and identifying codes in graphs of girth at least 5, General bounds on rainbow domination numbers, Three-arc graphs: characterization and domination, Location domination number of line graph, On minimum walks in graphs, ISOLATE SEMITOTAL DOMINATION IN GRAPHS, MINIMUM DOMINATING SETS WITH MINIMUM STATUS IN GRAPHS, The applicability matrix of a syntax-directed parsing processor, On finite 0-simple semigroups and graph theory, Drawing Shortest Paths in Geodetic Graphs, Flots et tensions dans un graphe, REGNANT AND CAPTIVE DOMINATION IN SOME GENERALIZED GRAPHS, An Algorithm for Vertex-pair Connectivity, Resolving Roman domination in graphs, Minimal degree of standard identities of matrix algebras with symplectic graded involution, Bounds for complete cototal domination number of Cartesian product graphs and complement graphs, Equality co-neighborhood domination in graphs, Some Vertex-Graph Parameters on Modular Product of Graphs, McMullen’s and geometric pressures and approximating the Hausdorff dimension of Julia sets from below, On the impossibility to construct certain classes of graphs by extensions, Betweenness centrality in Cartesian product of graphs, INVERSE DOMINATION AND INVERSE TOTAL DOMINATION FOR AN UNDIRECTED GRAPH, INVERSE DOMINATION NUMBER OF CIRCULANT GRAPH, (1, 2)-DOUBLE DOMINATION IN GRAPHS, 2-RESERVED DOMINATION NUMBER OF GRAPHS, ON WEAK DOMINATION NUMBER OF SOME GRAPHS, SOME RESULTS ON WEAK DOMINATION IN GRAPHS, Graphs with disjoint 2-dominating sets, A generalization of Kónig's theorem, On autographix conjecture regarding domination number and average eccentricity, Simultaneously dominating all spanning trees of a graph, LAPLACIAN EIGENVALUES OF GRAPHS WITH GIVEN DOMINATION NUMBER, More on the unimodality of domination polynomial of a graph, The relation between the number of leaves of a tree and its diameter, The lengths of limbs of random trees, Unnamed Item, Paths in the one‐skeleton of a convex body, NP-completeness of the independent dominating set problem in the class of cubic planar bipartite graphs, Some problems in discrete optimization, Two extensions of Leech labeling to the class of all graphs, Decomposition of bipartite multigraphs into matchings, Unnamed Item, Unnamed Item, Topological Aspects of Matrix Abduction 1, On the order dimension of locally countable partial orderings, Grafi e strutture algebriche, Unnamed Item, Unnamed Item, Optimal couplings between sparse block models, Partitioning a k-connected graph, Unnamed Item, ON COMPLEXITY OF THE SATISFIABILITY PROBLEM OF SYSTEMS OVER FINITE POSETS, DECIDABILITY OF THE RESTRICTED THEORIES OF A CLASS OF PARTIAL ORDERS, Domatically perfect graphs, Dominating 2-broadcast in graphs: Complexity, bounds and extremal graphs, Unnamed Item, Unnamed Item, On spatial mutation-selection models, Partial domination - the isolation number of a graph, Minimum independent dominating energy of graphs, [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions], Unnamed Item, On the dimension of vertex labeling of $k$-uniform dcsl of $k$-uniform caterpillar, On the facial structure of set packing polyhedra, On restricted domination in graphs, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, On the semigroup of binary relations on a finite set, Unnamed Item, Outer-convex domination in graphs, Lobe, edge, and arc transitivity of graphs of connectivity 1, On disjunctive domination in graphs, A characterization of graphs with disjoint total dominating sets, $B$-valuations of graphs, Domination versus disjunctive domination in graphs, Partitioning the Vertices of a Graph into Two Total Dominating Sets, Unnamed Item, Unnamed Item, Unnamed Item, New Clusterization Method Based on Graph Connectivity Search, Highly Irregular, My Top 10 Graph Theory Conjectures and Open Problems, The interchange graph of a finite graph, On the domination number of a graph and its total graph, Captive domination in graphs, Connected monophonic domination in graphs, Total pitchfork domination and its inverse in graphs, Drawing Shortest Paths in Geodetic Graphs, On the balanced domination of graphs, Graphoidally independent infinite graphs, Unnamed Item, A discrete dynamical system on the double circulant, On weighted adjacency operators associated to directed graphs, Double outer-independent domination number of graphs, Bounds on the domination number of a digraph and its reverse, Independent domination in signed graphs, On the domination number of a graph and its shadow graph, St. Alasdair on Lattices Everywhere, Partial ordering of the syntax elements of a language, Law of large numbers for a two-dimensional class cover problem, On the Algorithmic Complexity of Total Domination, Unnamed Item, Graph theoretic blockings k‐plexes and k‐cutpoints, Extremal values on the harmonic number of trees, Identifiability of a simultaneous equations model of economy: a structural view, Circulant discrete dynamical systems with threshold functions of at most three variables, Controllability and the theory of economic policy: a structural approach, Unnamed Item, Partitionability of trees, Certain exact and approximate algorithms for solving precedence problems with constraints, Unnamed Item, Bounds on a generalized domination parameter, Solvability of theories of certain classes of elimination graphs, Approximability results for the $p$-centdian and the converse centdian problems, On independent domination of regular graphs, On domination in signed graphs, Disproof of a conjecture on the minimum spectral radius and the domination number, Maximum spread of graphs and bipartite graphs, A Note on Isolate Domination Number of a Cubic Graph, On dominating graph of graphs, median graphs, partial cubes and complement of minimal dominating sets, Isolation of connected graphs, Multi-constructor CMSA for the maximum disjoint dominating sets problem, A sharp upper bound on the cycle isolation number of graphs, The dominating partition dimension and locating-chromatic number of graphs, Irreducible nonmetrizable path systems in graphs, A tight bound for independent domination of cubic graphs without 4‐cycles, Domination number and feedback vertex number of complements of line graphs, An iterated greedy algorithm for finding the minimum dominating set in graphs, Connected domination in random graphs, Edge-domatic number of a graph, Extended formulations for perfect domination problems and their algorithmic implications, Join graphs of trees, Unnamed Item, 3-component domination numbers in graphs, A dynamic algorithm for line graph recognition, On connected co-independent domination in the join, corona and lexicographic product of graphs, On k-cost effective domination in the corona and lexicographic product of graphs and its variant, On minimum intersections of certain secondary dominating sets in graphs, $st$-Orientations with Few Transitive Edges, The floor quotient partial order, Applying the (1,2)-pitchfork domination and it's inverse on some special graphs, On multiplicative sum Zagreb index of trees with fixed domination number, Graphs and algebras of symmetric functions, Domination in edge cycle graphs, Graphs with minimum fractional domatic number, Common domination perfect graphs, Some modified types of pitchfork domination and it's inverse, On the connectivity and diameter of geodetic graphs, On graphs with unique geoodesics and antipodes, Mean distance on metric graphs, Optimal linear‐Vizing relationships for (total) domination in graphs, Maxima of the \(A_\alpha\)-index of graphs with given size and domination number, Graphs with isolation number equal to one third of the order, Disjunctive total domination in permutation graphs, Conjugaison par tranches et dualitë de toland, SELF-ORGANIZING BIRTH-AND-DEATH STOCHASTIC SYSTEMS IN CONTINUUM, Unnamed Item, Unnamed Item, Unnamed Item, Signed intersection graphs, On the extremal values of the eccentric distance sum of trees, Two algorithms for determining a minimum independent dominating set, Independence numbers of product graphs, Partial order bounding: A new approach to evaluation in game tree search, Unnamed Item, An upper bound for domination number of 5-regular graphs, V -dualities and ⊥-dualities, Dualities between complete lattices, Proof of a conjecture on game domination, \(A\)-closed classes of idempotent functions of many-valued logic definable by binary relations, The inverse of a non-singular free matrix, Graph theory, Strong resolving partitions for strong product graphs and Cartesian product graphs, On Domination Number of 4-Regular Graphs, A note on the \(k\)-tuple total domination number of a graph, A bound on the k-domination number of a graph, Alliances and Related Domination Parameters, Domination and Spectral Graph Theory, Domination and Total Domination in Hypergraphs, Domination in Digraphs, Self-Stabilizing Domination Algorithms, Algorithms and Complexity of Alliances in Graphs, Multiple Domination, Distance Domination in Graphs, Locating-Domination and Identification, Signed and Minus Dominating Functions in Graphs, Rainbow Domination in Graphs, ON THE SUM OF INDEPENDENCE NUMBER AND AVERAGE DEGREE OF A GRAPH, Virtual transformations of data structures, Unnamed Item, The Complexity of the Partial Order Dimension Problem, Semicomplete Multipartite Digraphs, Covolumes of uniform lattices acting on polyhedral complexes, Domination in Semigraphs, Solutions of a problem of Ore on spanning trees and its generalization, Coloring the Cartesian Sum of Graphs, Upper whole domination in a graph, A direct method for calculating cell cycles of a block map of a simple planar graph, On Congruent Domination Number of Disjoint and One Point Union of Graphs, A varifold perspective on the $p$-elastic energy of planar sets, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Necessary conditions for a polynomial to be chromatic, Unnamed Item, Unnamed Item, A model of dynamics of group structures of human institutions, On some non-obvious connections between graphs and unary partial algebras, THE PARALLEL ALGORITHMS FOR DETERMINING EDGE-PACKING AND EFFICIENT EDGE DOMINATING SETS IN INTERVAL GRAPHS, SOME GENERAL ASPECTS OF THE FRAMING NUMBER OF A GRAPH, Weakly associative lattices and tolerance relations, Unnamed Item, Unnamed Item, Unnamed Item, First-order properties of bounded quantifier depth of very sparse random graphs, Introduction à l'algorithmique des objets partagés, On the non-cyclic graph of a group, Unnamed Item, Embedding the set of nondivisorial ideals of a numerical semigroup into ℕn, Personnel assignment by multiobjective programming, A forbidden subposet characterization of an order — dimension inequality, Constraint theory: an overview, Note über Kantenschnittverbände in Graphen, Complexity and approximation ratio of semitotal domination in graphs, Unnamed Item, Comparing language operations, On critically hamiltonian graphs, Further results on the least Q-eigenvalue of a graph with fixed domination number, Unnamed Item, Pitchfork domination in graphs, Equating two maximum degrees, Unnamed Item, Total $k$-Rainbow domination numbers in graphs, On a graph connecting hyperbinary expansions, Unnamed Item, Weakly convex and convex domination numbers for generalized Petersen and flower snark graphs, On the domination and signed domination numbers of zero-divisor graph, Upper bounds on the bondage number of a graph, A note on Fibonacci and Lucas number of domination in path, Unnamed Item, Tadpole domination in duplicated graphs, Doubly connected bi-domination in graphs, On the channel capacity of a state machine, SIGNED ROMAN DOMINATION NUMBER AND JOIN OF GRAPHS, Unnamed Item, Unnamed Item