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)

On equivalence relations induced by locally compact abelian Polish groups
On the restricted forwarding index problem in communication networks
The minimum matching energy of unicyclic graphs with fixed number of vertices of degree two
Spectral and extremal conditions for supereulerian graphs
The base sets of primitive zero-symmetric sign pattern matrices
Vector representations of graphs
Partitioning vertices of 1-tough graphs into paths
Wiener-type invariants on graph properties
Colorings with neighborhood parity condition
On the general sum-connectivity index of connected graphs with given order and girth
The dominant of the 2-connected-Steiner-subgraph polytope for \(W_ 4\)-free graphs
Panconnectivity in bipartite graphs with large degree sum
Variations on the Gallai-Milgram theorem
Sharp upper bounds on the spectral radius of graphs
On trees of a fixed maximum degree with extremal general atom-bond sum-connectivity index
The complexity of multicut and mixed multicut problems in (di)graphs
Neighbor connectivity of \(k\)-ary \(n\)-cubes
On the conjecture of bijection between perfect matching and sub-hypercube in folded hypercubes
Graphs with equal chromatic symmetric functions
On 1-Hamilton-connected claw-free graphs
The Zagreb indices of graphs with a given clique number
Binary stretch embedding of weighted graphs
Approximation algorithm for (connected) bounded-degree deletion problem on unit disk graphs
On eigensharp and almost eigensharp graphs
Clique partitions of complements of forests and bounded degree graphs
Sombor Index of c-Cyclic Chemical Graphs
Spanning 3-connected index of graphs
Facial parity edge colouring of plane pseudographs
Spanning trails with variations of Chvátal-Erdős conditions
The expected values for the Schultz index, Gutman index, multiplicative degree-Kirchhoff index and additive degree-Kirchhoff index of a random polyphenylene chain
A unified approach to distance-two colouring of graphs on surfaces
Linear hypergraphs with large transversal number and maximum degree two
Ultrametric properties for valuation spaces of normal surface singularities
On super 2-restricted and 3-restricted edge-connected vertex transitive graphs
On the vertex arboricity of planar graphs of diameter two
On the Erdős-Gyárfás conjecture in claw-free graphs
A sufficient condition for graphs to be \(\lambda_k\)-optimal
A closure concept based on neighborhood unions of independent triples
Signed graphs, nonorientable surfaces, and integer flows
Many \(T\) copies in \(H\)-free graphs
Minimum-rank and maximum-nullity of graphs and their linear preservers
Harper-type lower bounds and the bandwidths of the compositions of graphs
A fast parallel algorithm to recognize P4-sparse graphs
Minimum matrix representation of Sperner systems
Towards area requirements for drawing hierarchically planar graphs
Hybrid fault-tolerant prescribed hyper-Hamiltonian laceability of hypercubes
On the proper orientation number of chordal graphs
\(\mathsf{QCTL}\) model-checking with \(\mathsf{QBF}\) solvers
Spectral analogues of Erdős' theorem on Hamilton-connected graphs
The Wiener index of the \(k\)th power of a graph
Characteristics of common neighborhood graph under graph operations and on Cayley graphs
Strong matching preclusion for non-bipartite torus networks
Edge connectivity of simplicial polytopes
Clique-coloring of \(K_{3,3}\)-minor free graphs
Paths in circuit graphs of matroids
The subchromatic number of a graph
Hamiltonian cycles passing through linear forests in k-ary n-cubes
Freiman cover ideals of unmixed bipartite graphs
Hamilton paths in \(Z\)-transformation graphs of perfect matchings of hexagonal systems
On dominating sets of maximal outerplanar and planar graphs
Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs
Backbone coloring of planar graphs without special circles
Embedding Hamiltonian paths in \(k\)-ary \(n\)-cubes with conditional edge faults
The null set of the join of paths
On double-star decomposition of graphs
\(\lambda ^{\prime}\)-optimally connected mixed Cayley graphs
Orientations without forbidden patterns on three vertices
Matroidal approaches to rough sets via closure operators
On the parameterized complexity of coloring graphs in the absence of a linear forest
Edge fault tolerance of super edge connectivity for three families of interconnection networks
A note on face coloring entire weightings of plane graphs
Regular genus and gem-complexity of some mapping tori
The 3-path-connectivity of the \(k\)-ary \(n\)-cube
On multitracking of first-order MASs with adaptive coupling strength
On spanning 2-trees in a graph
A Chvátal-Erdős condition for (1,1)-factors in digraphs
Hyper star fault tolerance of bubble sort networks
Adjacency eigenvalues of graphs without short odd cycles
Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
Modularized data-driven approximation of the Koopman operator and generator
A Chvátal-Erdős condition for (t,t)-factors in digraphs using given arcs
On eigenvalues of complement digraphs
A classification of edge-colored graphs based on properly colored walks
Acyclic domination on bipartite permutation graphs
Maximum values of degree-based entropies of bipartite graphs
A neigborhood union condition for nonadjacent vertices in graphs
A note on equitable Hamiltonian cycles
Locally definable vertex set properties are efficiently enumerable
On cut vertices and eigenvalues of character graphs of solvable groups
The Erdős-Faber-Lovász conjecture revisited
Study of a combinatorial game in graphs through linear programming
Signless Laplacian spectral conditions for Hamilton-connected graphs with large minimum degree
The extension degree conditions for fractional factor
Characterizations of optimal component cuts of locally twisted cubes
A simple approach for lower-bounding the distortion in any hyperbolic embedding
Evolutionary hierarchical credibility
Almost all 3-connected graphs contain a contractible set of \(k\) vertices
On the skewness of Cartesian products with trees
Proof of a conjecture concerning maximum general sum-connectivity index \(\chi_\alpha\) of graphs with given cyclomatic number when \(1 < \alpha < 2\)
Subnetwork reliability analysis in \(k\)-ary \(n\)-cubes

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)