Theory and Applications of Graphs (Record no. 10439)
[ view plain ]
000 -LEADER | |
---|---|
fixed length control field | 04236nam a22004575i 4500 |
001 - CONTROL NUMBER | |
control field | 978-3-540-35912-8 |
003 - CONTROL NUMBER IDENTIFIER | |
control field | DE-He213 |
005 - DATE AND TIME OF LATEST TRANSACTION | |
control field | 20190213151353.0 |
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION | |
fixed length control field | cr nn 008mamaa |
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
fixed length control field | 121227s1978 gw | s |||| 0|eng d |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
International Standard Book Number | 9783540359128 |
-- | 978-3-540-35912-8 |
024 7# - OTHER STANDARD IDENTIFIER | |
Standard number or code | 10.1007/BFb0070359 |
Source of number or code | doi |
050 #4 - LIBRARY OF CONGRESS CALL NUMBER | |
Classification number | QA166-166.247 |
072 #7 - SUBJECT CATEGORY CODE | |
Subject category code | PBV |
Source | bicssc |
072 #7 - SUBJECT CATEGORY CODE | |
Subject category code | MAT013000 |
Source | bisacsh |
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
Classification number | 511.5 |
Edition number | 23 |
245 10 - TITLE STATEMENT | |
Title | Theory and Applications of Graphs |
Medium | [electronic resource] : |
Remainder of title | Proceedings, Michigan May 11–15, 1976 / |
Statement of responsibility, etc | edited by Yousef Alavi, Don R. Lick. |
264 #1 - | |
-- | Berlin, Heidelberg : |
-- | Springer Berlin Heidelberg : |
-- | Imprint: Springer, |
-- | 1978. |
300 ## - PHYSICAL DESCRIPTION | |
Extent | XIV, 638 p. |
Other physical details | online resource. |
336 ## - | |
-- | text |
-- | txt |
-- | rdacontent |
337 ## - | |
-- | computer |
-- | c |
-- | rdamedia |
338 ## - | |
-- | online resource |
-- | cr |
-- | rdacarrier |
347 ## - | |
-- | text file |
-- | |
-- | rda |
490 1# - SERIES STATEMENT | |
Series statement | Lecture Notes in Mathematics, |
International Standard Serial Number | 0075-8434 ; |
Volume number/sequential designation | 642 |
505 0# - FORMATTED CONTENTS NOTE | |
Formatted contents note | 200 years of graph theory — A guided tour -- Chromatic number and subgraphs of cayley graphs -- The multicolorings of graphs and hypergraphs -- Irreducible configurations and the four color conjecture -- Numbered complete graphs, unusual rulers, and assorted applications -- Cycles and semi-topological configurations -- Graphs with unique walks, trails or paths of given lengths -- Triangular imbeddings into surfaces of a join of equicardinal independent sets following an Eulerian graph -- Mixed graphs of homomorphisms -- On chromatic equivalence of graphs -- On graphs having prescribed clique number, chromatic number, and maximum degree -- Domination of undirected graphs — A survey -- Some extremal problems for simple two-complexes -- Various length paths in graphs -- Orthogonal groups over GF(2) and related graphs -- Distance matrix polynomials of trees -- Odd cycles and perfect graphs -- Imbeddings of metacyclic cayley graphs -- On the chromatic index and the cover index of a multigraph -- Pruning and depth first search -- Graphs and their degree sequences: A survey -- The bichromaticity of a tree -- On diameter stability of graphs -- Generalized pseudosurface embeddings of graphs and associated block designs -- Powers of graphs, line graphs, and total graphs -- The cartesian product of two graphs is stable -- A note on a generalized regularity condition -- Long and short walks in trees -- Random clumps, graphs, and polymer solutions -- Mixed ramsey numbers: Edge chromatic numbers vs. graphs -- Planar and outerplanar cayley graphs of free groups -- Coloring restrictions -- If a hadamard matrix of order 24 has character exactly 2, its transpose is known -- Cycle lengths in polytopal graphs -- Subgraph connectivity numbers of a graph -- Matchings in graphs III: Infinite graphs -- Steinhaus graphs -- Packing and covering constants for recursive trees -- The minimum degree and connectivity of a graph -- Generalizations of graphical parameters -- Pursuit-evasion in a graph -- Regularity in tournaments -- On graphs of embedding range one -- Non-existence of graph embeddings -- Food webs, competition graphs, and the boxicity of ecological phase space -- Hamiltonian persistency is periodic among iterated line digraphs -- Some problems in ramsey theory -- Exactly thirteen connected cubic graphs have integral spectra -- A counting theorem for topological graph theory -- k-Arc Hamilton graphs -- Hypohamiltonian graphs and digraphs -- Order preserving embeddings of aographs -- Circular arc graphs: New uses and a new algorithm -- Chromatic sums -- Infinite cayley graphs of connectivity one -- Edge-colorings of graphs — A survey -- Menger and könig systems. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name as entry element | Mathematics. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name as entry element | Graph theory. |
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name as entry element | Mathematics. |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name as entry element | Graph Theory. |
700 1# - ADDED ENTRY--PERSONAL NAME | |
Personal name | Alavi, Yousef. |
Relator term | editor. |
700 1# - ADDED ENTRY--PERSONAL NAME | |
Personal name | Lick, Don R. |
Relator term | editor. |
710 2# - ADDED ENTRY--CORPORATE NAME | |
Corporate name or jurisdiction name as entry element | SpringerLink (Online service) |
773 0# - HOST ITEM ENTRY | |
Title | Springer eBooks |
776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
Display text | Printed edition: |
International Standard Book Number | 9783540086666 |
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
Uniform title | Lecture Notes in Mathematics, |
-- | 0075-8434 ; |
Volume number/sequential designation | 642 |
856 40 - ELECTRONIC LOCATION AND ACCESS | |
Uniform Resource Identifier | http://dx.doi.org/10.1007/BFb0070359 |
912 ## - | |
-- | ZDB-2-SMA |
912 ## - | |
-- | ZDB-2-LNM |
912 ## - | |
-- | ZDB-2-BAE |
No items available.