Graph theory - MaRDI portal

MaRDI QIDQ5422499zbMATH OpenFDO

Authors J. A. Bondy, U. S. R. Murty

Publication date 22 October 2007

Recommendations

Graph theory
scientific article; zbMATH DE number 945671
Graph theory. A problem oriented approach
scientific article; zbMATH DE number 46669
scientific article; zbMATH DE number 1432797

Cited in

(only showing first 100 items - show all)

A factor \(2\) approximation algorithm for the vertex cover \(P_3\) problem
Two sharp upper bounds for the Laplacian eigenvalues.
Hamilton cycles and eigenvalues of graphs
A kind of conditional fault tolerance of alternating group graphs
Conditional connectivity of Cayley graphs generated by transposition trees
Lower bounds for constant degree independent sets
A kind of conditional vertex connectivity of star graphs
Circumferences and minimum degrees in 3-connected claw-free graphs
Identifying codes in trees and planar graphs
On maximum Estrada indices of graphs with given parameters
Skew-adjacency matrices of graphs
All hypoenergetic graphs with maximum degree at most 3
Orienting graphs to optimize reachability
On the rank of a cograph
A note on entire choosability of plane graphs
On the reciprocal degree distance of graphs
Enumerating the edge-colourings and total colourings of a regular graph
Embedding long cycles in faulty \(k\)-ary \(2\)-cubes
Maximal cycles in graphs
Component connectivity of the data center network dcell
Edge-fault-tolerant edge-bipancyclicity of hypercubes
Total colorings and list total colorings of planar graphs without intersecting 4-cycles
On the general sum-connectivity index of connected graphs with given order and girth
Bounds on the \(k\)-domination number of a graph
Broadcasting in DMA-bound bounded degree graphs
Computing the permanental polynomials of bipartite graphs by Pfaffian orientation
A classification of locally semicomplete digraphs
Claw-free graphs---a survey
Some upper bounds for the atom-bond connectivity index of graphs
On a closure concept in claw-free graphs
On acyclically 4-colorable maximal planar graphs
The \((k,\ell)\)-rainbow index for complete bipartite and multipartite graphs
Optimal packing of induced stars in a graph
Proper interval graphs and the guard problem
Chromatic roots and Hamiltonian paths
Color degree and heterochromatic cycles in edge-colored graphs
On dynamic monopolies of graphs: the average and strict majority thresholds
Generalized measures of fault tolerance in hypercube networks
Many-to-many two-disjoint path covers in restricted hypercube-like graphs
Boundary graph classes for some maximum induced subgraph problems
Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs
Hardness and inapproximability of convex recoloring problems
3-extra connectivity of 3-ary \(n\)-cube networks
On the contour of graphs
Disjoint path covers in cubes of connected graphs
Single-source three-disjoint path covers in cubes of connected graphs
Nowhere-zero 3-flows and modulo \(k\)-orientations
Spectral radius and Hamiltonian graphs
Many-to-many two-disjoint path covers in cylindrical and toroidal grids
A note on vertex colorings of plane graphs
Path and cycle sub-Ramsey numbers and an edge-colouring conjecture
Circular chromatic number and a generalization of the construction of Mycielski.
On the resistance diameters of graphs and their line graphs
A GRASP for the convex recoloring problem in graphs
A note on ``Tenacity of a graph with maximum connectivity
Minimizing maximum indegree
Circumferences of 3-connected claw-free graphs. II.
Integer programming approach to static monopolies in graphs
Coloring digraphs with forbidden cycles
Satisfying more than half of a system of linear equations over GF(2): a multivariate approach
Sufficient spectral conditions on Hamiltonian and traceable graphs
Boundary value problems on finite networks
Finding a complete matching with the maximum product on weighted bipartite graphs
Edge fault tolerance analysis of a class of interconnection networks
A sharp upper bound of the spectral radius of graphs
An optimal path cover algorithm for cographs
Graphs without spanning closed trails
Restricted connectivity for three families of interconnection networks
On the colorings of outerplanar graphs
Hamiltonicity in 3-connected claw-free graphs
Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes
Controller design for bush-type 1-D wave networks
Multiplex PI control for consensus in networks of heterogeneous linear agents
A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs
On the complexity of the independent set problem in triangle graphs
Rainbow \(C_4\)'s and directed \(C_4\)'s: the bipartite case study
The \((k,\ell)\)-rainbow index of random graphs
Trees with 2-reinforcement number three
Acyclically 4-colorable triangulations
Paired many-to-many disjoint path covers in faulty hypercubes
Equitable vertex arboricity of graphs
On Barnette's conjecture and the \(H^{+-}\) property
The 3-rainbow index and connected dominating sets
Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs
The 2-good-neighbor diagnosability of Cayley graphs generated by transposition trees under the PMC model and MM\(^\ast\) model
Algorithms for finding disjoint path covers in unit interval graphs
Approximation algorithms for minimum (weight) connected \(k\)-path vertex cover
Global cycle properties of locally isometric graphs
Global cycle properties in locally connected, locally traceable and locally Hamiltonian graphs
On the readability of overlap digraphs
Circumferences of 3-connected claw-free graphs
Complement reducible graphs
Second-order and local characteristics of network intensity functions
Long paths in hypercubes with conditional node-faults
Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
Characterization of interval graphs that are unpaired 2-disjoint path coverable
On dominating and spanning circuits in graphs
On graphs with no induced subdivision of \(K_4\)
On dynamic monopolies of graphs with general thresholds
Edge fault tolerance of graphs with respect to super edge connectivity

This page was built for publication: Graph theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5422499)