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)
Heat conduction on graphs ⋮ Steiner distance stable graphs ⋮ Containment of butterflies in networks constructed by the line digraph operation ⋮ Sphere of influence graphs: Edge density and clique size ⋮ On the ascending star subgraphs decomposition of star forests ⋮ On randomly n-cyclic digraphs ⋮ On the \(\ell\)-connectivity of a graph ⋮ The game chromatic number and the game colouring number of cactuses ⋮ On the planarity of the \(k\)-zero-divisor hypergraphs ⋮ The connected cutset connectivity of a graph ⋮ Gracefully cultivating trees on a cycle ⋮ The diversity of domination ⋮ Local edge domination critical graphs ⋮ A sufficient condition for graphs with large neighborhood unions to be traceable ⋮ Extraconnectivity of graphs with large minimum degree and girth ⋮ Maximum and minimum toughness of graphs of small genus ⋮ Uniquely \((m,k)^ \tau\)-colourable graphs and \(k-\tau\)-saturated graphs ⋮ Totally equimatchable graphs ⋮ The line digraph of a regular and pancircular digraph is also regular and pancircular ⋮ Chromatic equivalence classes of certain generalized polygon trees ⋮ \(P_ 3\)-factorization of complete bipartite graphs ⋮ Graph properties checkable in linear time in the number of vertices ⋮ The longest cycles in a graph G with minimum degree at least \(| G| /k\) ⋮ Greatest common subgroups with specified properties ⋮ On renaming a set of clauses as a Horn set ⋮ Some topics in cochromatic theory ⋮ Generalised game colouring of graphs ⋮ Trees with maximum number of maximal matchings ⋮ Size of weakly saturated graphs ⋮ Pairs of trees in tree--tree triangulations ⋮ On the ascending subgraph decompositions of regular graphs ⋮ Some properties of graphs determined by edge zeta functions ⋮ On partitional labelings of graphs ⋮ Langford sequences and a product of digraphs ⋮ Crosscap of the ideal based zero-divisor graph ⋮ On a neighborhood condition implying the existence of disjoint complete graphs ⋮ Infinite families of bi-embeddings ⋮ On the adjacent vertex-distinguishing acyclic edge coloring of some graphs ⋮ Partitioning regular graphs into equicardinal linear forests ⋮ The power of digraph products applied to labelings ⋮ Bipartite variation of the cheesecake factory problem: \(mH(k,2l+1)\)-factorization of \(K_{n,n}\) ⋮ The method of moments and degree distributions for network models ⋮ On multipartite tournaments ⋮ An Ore-type condition for the existence of \(k\)-factors in graphs ⋮ Contractible edges in non-separating cycles ⋮ One-factors and \(k\)-factors ⋮ Decomposition of complete bipartite digraphs and complete digraphs into directed paths and directed cycles of fixed even length ⋮ A new recursive theorem on \(n\)-extendibility ⋮ Matchings in random superpositions of bipartite trees ⋮ Extremal problems involving vertices and edges on odd cycles ⋮ On the \(r\)-domination number of a graph ⋮ Cycles of length 2 modulo 3 in graphs ⋮ A linear time algorithm for graph partition problems ⋮ Some upper bounds for the product of the domination number and the chromatic number of a graph ⋮ On total covers of graphs ⋮ A neighborhood condition which implies the existence of a complete multipartite subgraph ⋮ Generalized degrees and Menger path systems ⋮ Graphs on alphabets as models for large interconnection networks ⋮ The underlying graph of a line digraph ⋮ Neighborhood unions and a generalization of Dirac's theorem ⋮ Basic derivations for subarrangements of Coxeter arrangements ⋮ Bounds relating generalized domination parameters ⋮ Planar graphs and greatest common subgraphs ⋮ Asymptotics for Euclidean minimal spanning trees on random points ⋮ On partitional and other related graphs ⋮ Super edge-magic models ⋮ The complexity of some acyclic improper colourings ⋮ On minimal triangle-free graphs with prescribed \(k\)-defective chromatic number ⋮ Extending cycles in directed graphs ⋮ On the relations of graph parameters and its total parameters ⋮ Near-minimal spanning trees: A scaling exponent in probability models ⋮ Some extremal connectivity results for matroids ⋮ Sorting a sequence of strong kings in a tournament ⋮ Image analysis with partially ordered Markov models. ⋮ Superconnectivity of bipartite digraphs and graphs ⋮ Bounds on the size of graphs of given order and \(l\)-connectivity ⋮ Disjoint paths of bounded length in large generalized cycles ⋮ Sets defining minimal vertex covers ⋮ \(\widehat S_k\)-factorization of symmetric complete tripartite digraphs ⋮ Extraconnectivity of \(s\)-geodetic digraphs and graphs ⋮ Closure and Hamiltonian-connectivity of claw-free graphs ⋮ Paths and circuits in partially directed graphs ⋮ Cycle-factorization of symmetric complete multipartite digraphs ⋮ Chessboard graphs, related designs, and domination parameters ⋮ A degree condition for the existence of 1-factors in graphs or their complements ⋮ Restrained domination in graphs ⋮ Neighborhood unions and factor critical graphs ⋮ Cycles of length 0 modulo 4 in graphs ⋮ Structure graphs and structure graph grammars ⋮ The superconnectivity of large digraphs and graphs ⋮ A result about the incident edges in the graphs \(M_ k\) ⋮ Cellular automata and discrete neural networks ⋮ Upper bound for linear arboricity ⋮ Extremal results on defective colorings of graphs ⋮ On cohesion stable graphs ⋮ Projective plane embeddings of polyhedral pinched maps ⋮ On the \(l\)-connectivity of a digraph ⋮ Extremal problems and generalized degrees ⋮ Extraconnectivity of graphs with large girth ⋮ On the distance connectivity of graphs and digraphs
This page was built for publication:
