Sherali-adams relaxations of the matching polytope
Proceedings of the forty-first annual ACM symposium on Theory of computing
Super p-restricted edge connectivity of line graphs
Information Sciences: an International Journal
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Note: A proof of a conjecture on the Randić index of graphs with given girth
Discrete Applied Mathematics
Fair resource allocation for the Gaussian broadcast channel with ISI
IEEE Transactions on Communications
Computers and Operations Research
A class of transformations that polarize binary-input memoryless channels
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Homotopy types of box complexes of chordal graphs
European Journal of Combinatorics
Cycle covers (I) -- Minimal contra pairs and Hamilton weights
Journal of Combinatorial Theory Series B
On convex greedy embedding conjecture for 3-connected planar graphs
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Minimal identifying codes in trees and planar graphs with large girth
European Journal of Combinatorics
Compatibility between optimal tree-based broadcast routing and metric design
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Complexity results related to monophonic convexity
Discrete Applied Mathematics
Synergistic coding by cortical neural ensembles
IEEE Transactions on Information Theory - Special issue on information theory in molecular biology and neuroscience
Information Processing Letters
Data preservation under spatial failures in sensor networks
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
Two algorithms for minimum 2-connected r-hop dominating set
Information Processing Letters
Matching preclusion for k-ary n-cubes
Discrete Applied Mathematics
Solving MAX-r-SAT above a tight lower bound
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
TAIC PART'10 Proceedings of the 5th international academic and industrial conference on Testing - practice and research techniques
Decomposition of distributed nonmonotonic multi-context systems
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
Packing 3-vertex paths in claw-free graphs and related topics
Discrete Applied Mathematics
Lower bounds on the independence number of certain graphs of odd girth at least seven
Discrete Applied Mathematics
Elementary proof techniques for the maximum number of islands
European Journal of Combinatorics
Polar codes: characterization of exponent, bounds, and constructions
IEEE Transactions on Information Theory
Secret key generation for a pairwise independent network model
IEEE Transactions on Information Theory
Discrete Applied Mathematics
Narrowing down the gap on the complexity of coloring Pk-free graphs
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Bases of primitive nonpowerful sign patterns
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Pancyclicity of ternary n-cube networks under the conditional fault model
Information Processing Letters
Powers of cycles, powers of paths, and distance graphs
Discrete Applied Mathematics
Hamiltonian paths and cycles with prescribed edges in the 3-ary n-cube
Information Sciences: an International Journal
On acyclic edge coloring of toroidal graphs
Information Processing Letters
Note: A structural theorem for planar graphs with some applications
Discrete Applied Mathematics
On a local protocol for concurrent file transfers
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Information Processing Letters
Stable structure from motion for unordered image collections
SCIA'11 Proceedings of the 17th Scandinavian conference on Image analysis
Hamiltonian cycles passing through linear forests in k-ary n-cubes
Discrete Applied Mathematics
Note: Degree sequences and graphs with disjoint spanning trees
Discrete Applied Mathematics
One conjecture of bubble-sort graphs
Information Processing Letters
Video surveillance with PTZ cameras: the problem of maximizing effective monitoring time
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
Coloring graphs without short cycles and long induced paths
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Web quality assessment model: trust in QA social networks
UIC'11 Proceedings of the 8th international conference on Ubiquitous intelligence and computing
Theoretical Computer Science
A note on relaxed equitable coloring of graphs
Information Processing Letters
Backbone coloring of planar graphs without special circles
Theoretical Computer Science
Embedding hamiltonian paths in k-ary n-cubes with conditional edge faults
Theoretical Computer Science
RFID data analysis using tensor calculus for supply chain management
Proceedings of the 20th ACM international conference on Information and knowledge management
Operations Research
A new architectural paradigm for content-based web applications: Borè
Proceedings of the 15th Symposium on International Database Engineering & Applications
Constructing and Drawing Regular Planar Split Networks
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
An analysis of heuristics for vertex colouring
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Fault tolerance in bubble-sort graph networks
Theoretical Computer Science
Complexity of paths, trails and circuits in arc-colored digraphs
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Splittings of independence complexes and the powers of cycles
Journal of Combinatorial Theory Series A
Coordination of multi-link spectrum handoff in multi-radio multi-hop cognitive networks
Journal of Parallel and Distributed Computing
Scheduling links for heavy traffic on interfering routes in wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Journal of Biomedical Informatics
On dynamic coloring for planar graphs and graphs of higher genus
Discrete Applied Mathematics
Note: A note on planar graphs with large width parameters and small grid-minors
Discrete Applied Mathematics
Replicating for performance: case studies
Replication
A novel human motion recognition method based on eigenspace
ICIAR'10 Proceedings of the 7th international conference on Image Analysis and Recognition - Volume Part I
Recursive sum-product algorithm for generalized outer-planar graphs
Information Processing Letters
List coloring in the absence of a linear forest
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Two fixed-parameter algorithms for the cocoloring problem
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
4-coloring h-free graphs when h is small
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
The SALAH project: segmentation and linguistic analysis of ḥadīṯ arabic texts
AIRS'11 Proceedings of the 7th Asia conference on Information Retrieval Technology
European Journal of Combinatorics
Conditional connectivity of star graph networks under embedding restriction
Information Sciences: an International Journal
An application of rough sets to graph theory
Information Sciences: an International Journal
On the parameterized complexity of coloring graphs in the absence of a linear forest
Journal of Discrete Algorithms
Enforcing interaction and cooperation in content-based web3.0 applications
APWeb'12 Proceedings of the 14th Asia-Pacific international conference on Web Technologies and Applications
Algorithmic complexity of finding cross-cycles in flag complexes
Proceedings of the twenty-eighth annual symposium on Computational geometry
A hybrid artificial bee colony algorithm for graph 3-coloring
SIDE'12 Proceedings of the 2012 international conference on Swarm and Evolutionary Computation
Note: Computing the permanental polynomials of bipartite graphs by Pfaffian orientation
Discrete Applied Mathematics
Flows and parity subgraphs of graphs with large odd-edge-connectivity
Journal of Combinatorial Theory Series B
On graphs with no induced subdivision of K4
Journal of Combinatorial Theory Series B
Journal of Graph Theory
On the complexity of the herding attack and some related attacks on hash functions
Designs, Codes and Cryptography
Uniqueness in Discrete Tomography: Three Remarks and a Corollary
SIAM Journal on Discrete Mathematics
Spanning cycles in regular matroids without small cocircuits
European Journal of Combinatorics
Regular maps with nilpotent automorphism groups
European Journal of Combinatorics
New Bounds on the Grundy Number of Products of Graphs
Journal of Graph Theory
Characterization of removable elements with respect to having k disjoint bases in a matroid
Discrete Applied Mathematics
Certifying 3-connectivity in linear time
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Proceedings of the 8th ACM SIGPLAN workshop on Generic programming
Labeling outerplanar graphs with maximum degree three
Discrete Applied Mathematics
On the Randić index and girth of graphs
Discrete Applied Mathematics
Dimensions of biquadratic spline spaces over T-meshes
Journal of Computational and Applied Mathematics
Fault tolerance in k-ary n-cube networks
Theoretical Computer Science
Note on the hardness of generalized connectivity
Journal of Combinatorial Optimization
On L(2,1)-labeling of generalized Petersen graphs
Journal of Combinatorial Optimization
An Asymptotic Version of the Multigraph 1-Factorization Conjecture
Journal of Graph Theory
A generalization of Little's Theorem on Pfaffian orientations
Journal of Combinatorial Theory Series B
Matching preclusion for balanced hypercubes
Theoretical Computer Science
Computing connected components of simple undirected graphs based on generalized rough sets
Knowledge-Based Systems
Searching short recurrences of nonlinear shift registers via directed acyclic graphs
Inscrypt'11 Proceedings of the 7th international conference on Information Security and Cryptology
A linear algebra technique for (de)centralized processing of SPARQL queries
ER'12 Proceedings of the 31st international conference on Conceptual Modeling
Validation of network classifiers
SSPR'12/SPR'12 Proceedings of the 2012 Joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
Minimum codegree threshold for (K43-e)-factors
Journal of Combinatorial Theory Series A
On minimally rainbow k-connected graphs
Discrete Applied Mathematics
A simple test on 2-vertex- and 2-edge-connectivity
Information Processing Letters
Contractible configurations on 3-flows in graphs satisfying the Fan-condition
European Journal of Combinatorics
Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm
Computational Optimization and Applications
Analysis of strategy in robot soccer game
Neurocomputing
Watching systems in graphs: An extension of identifying codes
Discrete Applied Mathematics
Rainbow connection and minimum degree
Discrete Applied Mathematics
Discrete Applied Mathematics
The (conditional) matching preclusion for burnt pancake graphs
Discrete Applied Mathematics
Homeomorphically irreducible spanning trees
Journal of Combinatorial Theory Series B
Approximate min-max relations on plane graphs
Journal of Combinatorial Optimization
Obstructions to locally injective oriented improper colourings
European Journal of Combinatorics
Fault-free Hamiltonian cycles passing through a linear forest in ternary n-cubes with faulty edges
Theoretical Computer Science
Nowhere-zero 3-flows and modulo k-orientations
Journal of Combinatorial Theory Series B
On a conjecture of the Randić index and the minimum degree of graphs
Discrete Applied Mathematics
Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs
Discrete Applied Mathematics
A Graph Coloring Based TDMA Scheduling Algorithm for Wireless Sensor Networks
Wireless Personal Communications: An International Journal
Max-min weight balanced connected partition
Journal of Global Optimization
A sufficient condition for graphs to be λk-optimal
Discrete Applied Mathematics
Graph-based retrieval of building information models for supporting the early design stages
Advanced Engineering Informatics
Discrete Applied Mathematics
How many wireless resources are needed to resolve the hidden terminal problem?
Computer Networks: The International Journal of Computer and Telecommunications Networking
Paired many-to-many disjoint path covers in faulty hypercubes
Theoretical Computer Science
Subdigraphs with orthogonal factorizations of digraphs (II)
European Journal of Combinatorics
Clique-transversal sets and clique-coloring in planar graphs
European Journal of Combinatorics
On the vertex-distinguishing proper edge coloring of composition of complete graph and star
Information Processing Letters
The complexity of multicut and mixed multicut problems in (di)graphs
Theoretical Computer Science
Note: Total coloring of planar graphs with 7-cycles containing at most two chords
Theoretical Computer Science
Strong matching preclusion for torus networks
Theoretical Computer Science
International Journal of Robotics Research
Entire (Δ+2)-colorability of plane graphs
European Journal of Combinatorics
Replication in critical graphs and the persistence of monomial ideals
Journal of Combinatorial Theory Series A
On asteroidal sets in chordal graphs
Discrete Applied Mathematics
Aggregate nearest neighbor queries in uncertain graphs
World Wide Web
On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube
Journal of Combinatorial Optimization
Boundary graph classes for some maximum induced subgraph problems
Journal of Combinatorial Optimization
Combinatorica
Satisfying more than half of a system of linear equations over GF(2): A multivariate approach
Journal of Computer and System Sciences
Spanning 3-connected index of graphs
Journal of Combinatorial Optimization
An automatic subdigraph renovation plan for failure recovery of composite semantic Web services
Frontiers of Computer Science: Selected Publications from Chinese Universities
Fixed-parameter algorithms for the cocoloring problem
Discrete Applied Mathematics
On minimum balanced bipartitions of triangle-free graphs
Journal of Combinatorial Optimization
Improved upper bound for acyclic chromatic index of planar graphs without 4-cycles
Journal of Combinatorial Optimization
Hamiltonian path embeddings in conditional faulty k-ary n-cubes
Information Sciences: an International Journal
Hi-index | 0.13 |
Graph theory is a flourishing discipline containing a body of beautiful and powerful theorems of wide applicability. Its explosive growth in recent years is mainly due to its role as an essential structure underpinning modern applied mathematics computer science, combinatorial optimization, and operations research in particular but also to its increasing application in the more applied sciences. The versatility of graphs makes them indispensable tools in the design and analysis of communication networks, for instance. The primary aim of this book is to present a coherent introduction to the subject, suitable as a textbook for advanced undergraduate and beginning graduate students in mathematics and computer science. It provides a systematic treatment of the theory of graphs without sacrificing its intuitive and aesthetic appeal. Commonly used proof techniques are described and illustrated, and a wealth of exercises - of varying levels of difficulty - are provided to help the reader master the techniques and reinforce their grasp of the material. A second objective is to serve as an introduction to research in graph theory. To this end, sections on more advanced topics are included, and a number of interesting and challenging open problems are highlighted and discussed in some detail. Despite this more advanced material, the book has been organized in such a way that an introductory course on graph theory can be based on the first few sections of selected chapters. Visit the graph theory book blog at: http://blogs.springer.com/bondyandmurty/.