scientific article
From MaRDI portal
Publication:3818315
zbMath0666.05001MaRDI QIDQ3818315
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Trees (05C05) Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Graph theory (05C99) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Eulerian and Hamiltonian graphs (05C45) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph theory (05Cxx)
Related Items (only showing first 100 items - show all)
Monochromatic infinite paths ⋮ The irregularity cost or sum of a graph ⋮ A smallest irregular oriented graph containing a given diregular one ⋮ On minimum locally $n$-(arc)-strong digraphs ⋮ Large \((d,D, D',s)\)-bipartite digraphs ⋮ On congruence in \(\mathbb{Z}^ n\) and the dimension of a multidimensional circulant ⋮ Irredundance perfect graphs ⋮ On the structure of graphs uniquely hamiltonian-connected from a vertex ⋮ Dependence polynomials ⋮ Optimal parallel construction of prescribed tournaments ⋮ A unified formulation of Kautz network and generalized hypercube ⋮ A simple a. s. correct algorithm for deciding if a graph has a perfect matching ⋮ A generalization of semimodular supersolvable lattice ⋮ On the beta-number of forests with isomorphic components ⋮ An improved parameterized algorithm for the minimum node multiway cut problem ⋮ Diameter vulnerability of iterated line digraphs ⋮ A new labeling construction from the \(\otimes_h\)-product ⋮ A longest cycle version of Tutte's wheels theorem ⋮ Tournaments, oriented graphs and football sequences ⋮ The complexity of recognizing tough cubic graphs ⋮ Unnamed Item ⋮ A characterization of graphs \(G\) with \(G\cong K^ 2(G)\) ⋮ Well irredundant graphs ⋮ Diameter-vulnerability of large bipartite digraphs ⋮ The algorithmic complexity of minus domination in graphs ⋮ An algorithm to find two distance domination parameters in a graph ⋮ On the strong Roman domination number of graphs ⋮ Dominator sequences in bipartite graphs ⋮ Total chromatic number of regular graphs of odd order and high degree ⋮ Fault-tolerant routings in double fixed-step networks ⋮ Using maximality and minimality conditions to construct inequality chains ⋮ Connectivity of large bipartite digraphs and graphs ⋮ On the genus of joins and compositions of graphs ⋮ Edge frames of graphs: A graph embedding problem ⋮ The \(k\)-annihilating-ideal hypergraph of commutative ring ⋮ A note on dominating cycles in 2-connected graphs ⋮ On the extraconnectivity of graphs ⋮ Bipartite graphs and digraphs with maximum connectivity ⋮ Parallel complexity of partitioning a planar graph into vertex-induced forests ⋮ On the Steiner median of a tree ⋮ On the genus of graphs from commutative rings ⋮ Perfect (super) edge-magic crowns ⋮ Multiplicity of solutions to second-order linear differential equations on networks ⋮ Degree sequence for \(k\)-arc strongly connected multiple digraphs ⋮ Classification of non-local rings with projective 3-zero-divisor hypergraph ⋮ Classification of de Bruijn-based labeled digraphs ⋮ (Di)graph products, labelings and related results ⋮ On the number of \(\alpha\)-labeled graphs ⋮ A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two ⋮ Maximum genus and chromatic number of graphs ⋮ A note on adjacent strong edge coloring of \(K(n,m)\) ⋮ An algorithm to generate tournament score sequences ⋮ Connected factors in \(K_{1,n}\)-free graphs containing an \([a,b\)-factor] ⋮ The \(k\)-maximal hypergraph of commutative rings ⋮ Nilpotent graphs with crosscap at most two ⋮ Labeling constructions using digraph products ⋮ Total polynomials of uniform oriented matroids ⋮ A note on the complexity of longest path problems related to graph coloring ⋮ The jumping knight and other (super) edge-magic constructions ⋮ The genus of graphs associated with vector spaces ⋮ Properties of vertex cover obstructions ⋮ Distance distributions for graphs modeling computer networks ⋮ Coloring graphs with fixed genus and girth ⋮ Different generalizations of bags ⋮ On 3-regular 4-ordered graphs ⋮ Strong labelings of linear forests ⋮ Covering partially directed graphs with directed paths ⋮ Yang-Baxter equation in median algebras ⋮ Calculation of the accessibility number and the neighbor integrity of a graph ⋮ On the genus of the \(k\)-annihilating-ideal hypergraph of commutative rings ⋮ Why the characteristic polynomial factors ⋮ Vertex-Coloring with Star-Defects ⋮ On extremal sizes of locally k-tree graphs ⋮ On integral sum graphs with a saturated vertex ⋮ (Di)graph decompositions and magic type labelings: a dual relation ⋮ New constructions for the \(n\)-queens problem ⋮ On strong distances in oriented graphs ⋮ The central limit theorem for weighted minimal spanning trees on random points ⋮ Pseudo-Cartesian products and Hamiltonian decompositions of Cayley graphs on abelian groups ⋮ Unnamed Item ⋮ Graphs and Algorithms in Communication Networks on Seven League Boots ⋮ Superfluous edges and exponential expansions of de Bruijn and Kautz graphs ⋮ Roots of independence polynomials of well covered graphs ⋮ A topological characterization of end sets of a twinning of a tree ⋮ Star-path bipartite Ramsey numbers ⋮ A game of cops and robbers played on products of graphs ⋮ Vertex colorings with a distance restriction ⋮ Interpolation theorems for domination numbers of a graph ⋮ Connectivity and extendability in digraphs ⋮ On minimally \((n,\lambda)\)-connected graphs ⋮ Asymptotically large (\(\Delta,D\))-graphs ⋮ Efficient dominating sets in labeled rooted oriented trees ⋮ The relation of matching with inverse degree of a graph ⋮ Nonorientable genera of Petersen powers ⋮ On the Nordhaus-Gaddum Problem for the k-Defective Chromatic Number of a Graph ⋮ Least Common Multiple of a Cycle and a Star ⋮ Fixed Point Sets in Digital Topology, 2 ⋮ Some new large compound graphs ⋮ Adjacent strong edge coloring of graphs ⋮ A new structural mechanism for reducibility of stochastic PERT networks
This page was built for publication:
