scientific article; zbMATH DE number 1270594
From MaRDI portal
Publication:4237089
zbMath0920.05001MaRDI QIDQ4237089
Jonathan L. Gross, Jay E. Yellen
Publication date: 29 March 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Graph theory (05Cxx)
Related Items (55)
Remarks on Caristi's fixed point theorem in metric spaces with a graph ⋮ Unnamed Item ⋮ Quantum algorithms for matching problems ⋮ On certain arithmetic integer additive set-indexers of graphs ⋮ Constructions of binary codes based on bipartite graphs ⋮ Some new families of graceful graphs ⋮ Some Edge Pair Sum Graphs ⋮ The Center Colorıng of a Graph ⋮ Topology optimisation of repairable flow networks for a maximum average availability ⋮ Fan-crossing free graphs and their relationship to other beyond-planar graphs ⋮ Exact algorithms for maximum induced matching ⋮ DVcube: a novel compound architecture of disc-ring graph and hypercube-like graph ⋮ Further results on edge even graceful labeling of the join of two graphs ⋮ Unnamed Item ⋮ A generalization of de Bruijn graphs and classification of endomorphisms of Cuntz algebras by graph invariants ⋮ On the complexity of role colouring planar graphs, trees and cographs ⋮ Fixed point results for generalized contraction mappings and cyclical mappings in \(b\)-metric spaces endowed with a digraph ⋮ Forbidding and enforcing on graphs ⋮ Analytic varieties as limit periodic sets ⋮ Common Fixed Point Results in C ∗ -Algebra Valued b-Metric Spaces Via Digraphs ⋮ Common Fixed Points Via R-Functions and Digraphs with an Application to Homotopy Theory ⋮ Unnamed Item ⋮ Coincidence point results for graph preserving hybrid pair of mappings ⋮ Data transfer planning with tree placement for collaborative environments ⋮ Unnamed Item ⋮ Classical Ising model test for quantum circuits ⋮ Single-crossover recombination and ancestral recombination trees ⋮ On the exact evaluation of certain instances of the Potts partition function by quantum computers ⋮ Caristi fixed point theorem in metric spaces with a graph ⋮ On Complexity of Total Vertex Cover on Subcubic Graphs ⋮ A study on prime arithmetic integer additive set-indexers of graphs ⋮ Edge even graceful labeling of torus grid graph ⋮ New perspectives on classical meanness of some ladder graphs ⋮ COMPLEX SEMANTIC NETWORKS ⋮ Some new coincidence point results for single-valued and multi-valued mappings in \(b\)-metric spaces via digraphs ⋮ Walks: A Beginner's Guide to Graphs and Matrices ⋮ Some fixed point theorems in cone modular spaces with a graph ⋮ Treewidth computations. I: Upper bounds ⋮ Normal form backward induction for decision trees with coherent lower previsions ⋮ Sources of complexity in subset choice ⋮ Complexity of the critical node problem over trees ⋮ Matrices with a strictly dominant eigenvalue ⋮ The cable trench problem: Combining the shortest path and minimum spanning tree problems ⋮ Extending of edge even graceful labeling of graphs to strong \(r\)-edge even graceful labeling ⋮ Existence and uniqueness of solution for two one-phase Stefan problems with variable thermal coefficients ⋮ Some results on (a,d)-distance antimagic labeling ⋮ Edge \(\delta\)-graceful labeling for some cyclic-related graphs ⋮ On Vertices and Facets of Combinatorial 2-Level Polytopes ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Some new results on strong integer additive set-indexers of graphs ⋮ Edge even graceful labeling of polar grid graphs ⋮ Unnamed Item ⋮ General vertex-distinguishing total coloring of graphs ⋮ Edge even graceful labeling of cylinder grid graph
This page was built for publication:
