BN.com Gift Guide

Graph Theory, Combinatorics, Algorithms and Applications

Hardcover (Print)
Used and New from Other Sellers
Used and New from Other Sellers
from $355.18
Usually ships in 1-2 business days
Other sellers (Hardcover)
  • All (1) from $355.18   
  • Used (1) from $355.18   
Close
Sort by
Page 1 of 1
Showing All
Note: Marketplace items are not eligible for any BN.com coupons and promotions
$355.18
Seller since 2006

Feedback rating:

(60901)

Condition:

New — never opened or used in original packaging.

Like New — packaging may have been opened. A "Like New" item is suitable to give as a gift.

Very Good — may have minor signs of wear on packaging but item works perfectly and has no damage.

Good — item is in good condition but packaging may have signs of shelf wear/aging or torn packaging. All specific defects should be noted in the Comments section associated with each item.

Acceptable — item is in working order but may show signs of wear such as scratches or torn packaging. All specific defects should be noted in the Comments section associated with each item.

Used — An item that has been opened and may show signs of wear. All specific defects should be noted in the Comments section associated with each item.

Refurbished — A used item that has been renewed or updated and verified to be in proper working condition. Not necessarily completed by the original manufacturer.

Very Good
Former Library book. Great condition for a used book! Minimal wear. 100% Money Back Guarantee. Shipped to over one million happy customers. Your purchase benefits world literacy!

Ships from: Mishawaka, IN

Usually ships in 1-2 business days

  • Canadian
  • International
  • Standard, 48 States
  • Standard (AK, HI)
  • Express, 48 States
  • Express (AK, HI)
Page 1 of 1
Showing All
Close
Sort by

Product Details

  • ISBN-13: 9789810218553
  • Publisher: World Scientific Publishing Company, Incorporated
  • Publication date: 1/28/1994
  • Pages: 500

Table of Contents

Acknowledgments
Preface
Super Line Graphs and Their Properties 1
On Gallai-Type Min-Max Inequalities 7
The Total Colouring of Some Graphs 17
Clique Partitions of Split Graphs 21
Half Essentially Disconnected Coronoids 31
Further Results on Minimal Broadcast Networks 47
Jackson's Conjecture on Eulerian Subgraphs 53
Lower Bound of Long Cycles of 1-Tough Graphs with Large Degree Sums 59
Existence of Spanning Eulerian Subgraphs in Triangle-Free Graphs 61
Complete Mappings of Linear Groups 69
Automorphism Groups of Cayley Digraphs 77
Chromatic Index of Critical Graphs of Order 11 83
Current Results and Problems on Factors of Graphs 93
Shedding Some Light on Shadows 99
Critical Sets and Critical Partial Latin Squares 111
Multipartite Tournaments having Exactly Four 4-Kings 125
Bandwidth for Graphs with Vertices Merged 137
On Edge-Hamiltonian Property of Cayley Graphs 147
Hamilton Property on 2-Order Neighbour Connected Claw-Free Graphs 151
Long Cycles in 1-Tough Graphs of Even Order 161
On Hamiltonian Line Graphs 177
A Sufficient Condition for 1-Tough Graphs to be Hamiltonian 183
The Connectivity of Path Graphs 187
On k-Critically h-Edge-Connected Graphs 193
Pancyclicity in Hamiltonian Line Graphs 205
A Kind of Infinite Sequence of Graceful Graph [actual symbol not reproducible] 215
Two Dimensional Bandwidth Problem 223
The Neighborhood Condition for Pancyclic Graphs 233
The Relation between the Total Chromatic Number and the Cycle Rank of a Graph 241
Formulas on the Number of Spanning Trees 247
Distance, Neighborhood Unions and Hamiltonian Properties in Graphs 255
Some New Theorems on Hasratian-Khachatrian's Condition for Hamiltonian Properties 269
Minimum 3-cut of a Planar Graph in O(n[superscript 4]) Time 275
Pancyclism in some K[subscript 1,3]-Free Graphs 281
Some Results for Cycle Covers of Graphs 287
On the Connectivity of Cayley Digraphs 295
Connectivities of Cartesian Products of Graphs 301
On the Chromatic Coefficients of a Graph and Chromatic Uniqueness of Certain n-Partition Graphs 307
Long Dominating Paths in Graphs 317
On Some Properties of Contraction-Critical Graphs 329
The Independent Subsets' Neighborhood and Minimum Degrees of k-Covered and k-Deleted Graphs 339
On Harmoniousness and Complete Mappings Decomposable into Disjoint Cycles of the Same Length 347
On Arithmetic Numbering of Cycles 355
Some Results on Arboricity Parameters of the Nordhaus-Gaddum Class 363
Hamiltonian Cycles in 2-Connected Graphs 373
Combinatorial Invariance of Kempe Sets 389
Pancyclic Line Graphs 399
Isomorphic Factorization of Tensor Product of Cycles 405
Some Theorems on (g,f)-Factorizations of Graphs 411
On the Gracefulness of the Union of Two Stars and Three Stars 417
On the Gracefulness of Product Graph C[subscript 4n+2] x P[subscript 4m+3] 425
Interpolation Theorems for the f-Chromatic Index of Multigraphs 433
Characteristics of Some Coefficients of Chromatic Polynomials 439
On the Maximum Number of Edges in a Graph in which No Two Cycles have the Same Length 447
Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)