Combinatorics and Graph Theory : Proceedings of the Symposium Held at the Indian Statistical Institute, Calcutta, February 25 29, 1980
محفوظ في:
| مؤلف مشترك: | |
|---|---|
| مؤلفون آخرون: | |
| التنسيق: | Livre numérique |
| اللغة: | Anglais |
| منشور في: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| سلاسل: | Lecture notes in mathematics
885 |
| الموضوعات: | |
| الوصول للمادة أونلاين: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| ملاحظة: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Combinatorics and graph theory, proceedings of the symposium held at the Indian statistical institute, Calcutta, February 25-29, 1980, edited by S. B. Rao, 1981, Berlin [etc.], Springer-Verlag, 1 vol. (VII-500 p.), Lecture notes in mathematics, 0-387-11151-4 • Combinatorics and Graph Theory, Texte imprimé, 9783662176818 |
| LEADER | 05226nam a22003977a 4500 | ||
|---|---|---|---|
| 001 | 972379 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155223135 | ||
| 020 | |a 9783540470373 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 510 | ||
| 084 | |a 62K10. 1980 | ||
| 084 | |a 05CXX. 1980 | ||
| 084 | |a 05BXX. 1980 | ||
| 111 | 2 | |a Symposium on combinatorics and graph theory |n (2 |d :1980 |c :Calcutta, Inde). | |
| 245 | 1 | 0 | |a Combinatorics and Graph Theory : |b Proceedings of the Symposium Held at the Indian Statistical Institute, Calcutta, February 25 29, 1980 |c edited by Siddani Bhaskara Rao. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in mathematics |v 885 |x 1617-9692 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Diperfect Graphs -- Some new problems and results in Graph Theory and other branches of Combinatorial Mathematics -- A form invariant multivariable polynomial representation of graphs -- Some combinatorial applications of the new linear programming algorithm -- In search of a complete invariant for graphs -- Affine triple systems -- Tables of two-graphs -- Designs, adjacency multigraphs and embeddings: A survey -- On the adjugate of a symmetrical balanced incomplete block design with ?=1 -- Characterization of potentially connected integer-pair sequences -- Construction and combinatorial properties of orthogonal arrays with variable number of symbols in rows -- Construction of group divisible rotatable designs -- Some path-length properties of graphs and digraphs -- 2-2 Perfect graphic degree sequences -- Characterization of forcibly outerplanar graphic sequences -- Characterization of potentially self-complementary, self-converse degree-pair sequences for digraphs -- Set-reconstruction of chain sizes in a class of finite topologies -- Characterization of forcibly bipartite self-complementary bipartitioned sequences -- A graph theoretical recurrence formula for computing the characteristic polynomial of a matrix -- A note concerning Acharya s conjecture on a spectral measure of structural balance in a social system -- On permutation-generating strings and rosaries -- Enumeration of labelled digraphs and hypergraphs -- Analysis of a spanning tree enumeration algorithm -- Binding number, cycles and complete graphs -- A class of counterexamples to a conjecture on diameter critical graphs -- Reconstruction of a pair of connected graphs from their line-concatenations -- On domination related concepts in Graph Theory -- The local central limit theorem for Stirling numbers of the second kind and anestimate for bell numbers -- A family of hypo-hamiltonian generalized prisms -- Graphical cyclic permutation groups -- Orthogonal main effect plans with variable number of levels for factors -- On molecular and atomic matroids -- New inequalities for the parameters of an association scheme -- On the (4 3)-regular subgraph conjecture -- Enumeration of Latin rectangles via SDR s -- Nearly line regular graphs and their reconstruction -- On reconstructing separable digraphs -- Degree sequences of cacti -- A survey of the theory of potentially P-graphic and forcibly P-graphic degree sequences -- Towards a theory of forcibly hereditary P-graphic sequences -- The minimal forbidden subgraphs for generalized line-graphs -- Spectral characterization of the line graph of K ? n -- Balanced arrays from association schemes and some related results -- Some further combinatorial and constructional aspects of generalized Youden designs -- Maximum degree among vertices of a non-Hamiltonian homogeneously traceable graph. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 650 | |a Théorie des graphes | ||
| 650 | |a Analyse combinatoire | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Rao, Siddani Bhaskara, |d 1945- |4 pbd | |
| 776 | 0 | |0 024400688 |t Combinatorics and graph theory |o proceedings of the symposium held at the Indian statistical institute, Calcutta, February 25-29, 1980 |f edited by S. B. Rao |d 1981 |c Berlin [etc.] |n Springer-Verlag |p 1 vol. (VII-500 p.) |s Lecture notes in mathematics |z 0-387-11151-4 | |
| 776 | 0 | |t Combinatorics and Graph Theory |b Texte imprimé |z 9783662176818 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/BFb0092249 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-G1C7TZ2D-V |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:75064219X |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/BFb0092249 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:753993422 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/BFb0092249 |z Accès INSA CVL | |
| 997 | |0 972379 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||