scientific article

Publication date: 16 November 2011

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

Applications of graph theory (05C90) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Sampling theory in information and communication theory (94A20) Graph theory (05Cxx)

Related Items (only showing first 100 items - show all)

\(g\)-good-neighbor conditional diagnosability measures for 3-ary \(n\)-cube networks ⋮ Weak saturation number for multiple copies of the complete graph with a star removed ⋮ Classification of finite commutative rings with planar, toroidal, and projective line graphs associated with Jacobson graphs ⋮ On energy of line graphs ⋮ Heavy subgraph conditions for longest cycles to be heavy in graphs ⋮ The cycle's structure of embedded graphs in surfaces ⋮ Hamiltonian cycle embedding for fault tolerance in balanced hypercubes ⋮ jHoles: a tool for understanding biological complex networks via clique weight rank persistent homology ⋮ Acyclic coloring of graphs with some girth restriction ⋮ A simple greedy approximation algorithm for the minimum connected \(k\)-center problem ⋮ Inverse 1-median problem on block graphs with variable vertex weights ⋮ The \(g\)-good-neighbor conditional diagnosability of \(n\)-dimensional hypercubes under the MM* model ⋮ Hamiltonian decomposition of generalized recursive circulant graphs ⋮ An extremal problem on bigraphic pairs with an \(A\)-connected realization ⋮ Generalized probabilistic \(G\)-contractions ⋮ An implicit degree condition for relative length of long paths and cycles in graphs ⋮ Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz ⋮ On the spectral moment of graphs with given clique number ⋮ 0-sum and 1-sum flows in regular graphs ⋮ Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle. ⋮ Cycle covers. II: Circuit chain, Petersen chain and Hamilton weights. ⋮ Solution to a problem on Hamiltonicity of graphs under Ore- and Fan-type heavy subgraph conditions ⋮ Updating \(\leqslant, <\)-chains ⋮ A note on edge-disjoint Hamilton cycles in line graphs ⋮ Embedding generalized Petersen graph in books ⋮ Topological indices of the line graph of subdivision graphs and their Schur-bounds ⋮ Hamiltonian cycles in spanning subgraphs of line graphs ⋮ A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles ⋮ An improved bound on 2-distance coloring plane graphs with girth 5 ⋮ Minimum implicit degree condition restricted to claws for Hamiltonian cycles ⋮ A note on the complexity of the causal ordering problem ⋮ Cubic non-Cayley vertex-transitive bi-Cayley graphs over a regular \(p\)-group ⋮ On the hyperbolicity of bipartite graphs and intersection graphs ⋮ Hamilton cycles in almost distance-hereditary graphs ⋮ Clique-heavy subgraphs and pancyclicity of 2-connected graphs ⋮ Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs ⋮ Neighbor sum distinguishing total choosability of planar graphs ⋮ Maximum size of digraphs with some parameters ⋮ A diagnosis algorithm by using graph-coloring under the PMC model ⋮ A note on the minimum total coloring of planar graphs ⋮ Induced subgraphs with large degrees at end-vertices for Hamiltonicity of claw-free graphs ⋮ Some class 1 graphs on \(g_c\)-colorings ⋮ Degree sum of a pair of independent edges and \(Z_{3}\)-connectivity ⋮ Perfect set of Euler tours of \(K_{p,p,p}\) ⋮ On the edge-hyper-Hamiltonian laceability of balanced hypercubes ⋮ Maximising expectation of the number of transplants in kidney exchange programmes ⋮ Word-representability of face subdivisions of triangular grid graphs ⋮ Color degree sum conditions for rainbow triangles in edge-colored graphs ⋮ Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs ⋮ The number of colorings of planar graphs with no separating triangles ⋮ On edge colorings of 1-toroidal graphs ⋮ Unit graphs of rings of polynomials and power series ⋮ Bounds for incidence energy of some graphs ⋮ Graph operations and neighbor rupture degree ⋮ Neighbor sum distinguishing index ⋮ A note on Turán numbers for even wheels ⋮ An implicit degree condition for pancyclicity of graphs ⋮ Advanced lower bounds for the circumference ⋮ Transforming monitoring structures with resilient encoders -- application to repeated games ⋮ Ordering polygonal chains with respect to Hosoya index ⋮ Group edge choosability of planar graphs without adjacent short cycles ⋮ Edge coloring by total labelings of outerplanar graphs ⋮ Properties of Hamilton cycles of circuit graphs of matroids ⋮ On extremal \(k\)-supereulerian graphs ⋮ An implicit degree Ore-condition for pancyclicity of graphs ⋮ Ore- and Fan-type heavy subgraphs for Hamiltonicity of 2-connected graphs ⋮ Rainbow \(C_3\)'s and \(C_4\)'s in edge-colored graphs ⋮ Cubic factorizations ⋮ Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey ⋮ On the mixed minus domination in graphs ⋮ Full friendly index set. I ⋮ Tree-designs with balanced-type conditions ⋮ Vertex Nim played on graphs ⋮ Tricyclic graphs with exactly two main eigenvalues ⋮ Greedy routing via embedding graphs onto semi-metric spaces ⋮ Equitable and list equitable colorings of planar graphs without 4-cycles ⋮ Degree sum of 3 independent vertices and \(Z_3\)-connectivity ⋮ \(Z_3\)-connectivity in abelian Cayley graphs ⋮ Optimally restricted edge connected elementary Harary graphs ⋮ Injective coloring of plane graphs with girth 5 ⋮ List total coloring of pseudo-outerplanar graphs ⋮ Total coloring of planar graphs with maximum degree 8 ⋮ The maximum Perron roots of digraphs with some given parameters ⋮ Some inverse optimization problems on network ⋮ Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges ⋮ Neighbor sum distinguishing index of planar graphs ⋮ Decomposition of complete bipartite graphs into paths and cycles ⋮ Rainbow numbers for matchings in plane triangulations ⋮ Realizing degree sequences as \(Z_3\)-connected graphs ⋮ On linear coloring of planar graphs with small girth ⋮ Hamilton cycles in implicit claw-heavy graphs ⋮ How to personalize the vertices of a graph? ⋮ Graph factors modulo \(k\) ⋮ An iterative rounding 2-approximation algorithm for the \(k\)-partial vertex cover problem ⋮ Total colorings of \(F_5\)-free planar graphs with maximum degree 8 ⋮ Counting 2-connected 4-regular maps on the projective plane ⋮ Minimum number of disjoint linear forests covering a planar graph ⋮ Some extremal graphs with respect to inverse degree ⋮ On degree resistance distance of cacti ⋮ Realizability of fault-tolerant graphs

This page was built for publication: