scientific article
From MaRDI portal
Publication:3899969
zbMath0453.00012MaRDI QIDQ3899969
No author found.
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06) Graph theory (05Cxx) Conference proceedings and collections of articles (00Bxx)
Related Items
Connectivities of random circulant digraphs, The nonexistence of reduction rules giving an embedding into a \(k\)-tree, An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs, Multiobjective traveling salesperson problem on Halin graphs, Unnamed Item, \(P_{4}\)-laden graphs: A new class of brittle graphs, Bi-complement reducible graphs, On semi-\(P_ 4\)-sparse graphs, On graphs without \(P_ 5\) and \(\overline {P}_ 5\), Almost all Cayley graphs have diameter 2, On the closure of graphs under substitution, On circulant digraphs with regular automorphism groups, On bipartite graphs with weak density of some subgraphs, Skew rank decompositions, The nonorientable genus of the join of two cycles, The projective plane crossing numbers of circular graphs, Classification of regular planar graphs with diameter two, On extended \(P_4\)-reducible and extended \(P_4\)-sparse graphs, CONNECTED COMMON NEIGHBORHOOD SYSTEMS OF CLIQUES IN A GRAPH: A POLYNOMIAL REPRESENTATION, INDUCED CYCLE POLYNOMIAL OF A GRAPH, CONNECTED TOTAL DOMINATING NEIGHBORHOOD POLYNOMIAL OF GRAPHS, CONVEX INDEPENDENT COMMON NEIGHBORHOOD POLYNOMIAL OF A GRAPH, COMBINATORIAL APPROACH FOR COUNTING GEODETIC SETS WITH SUBDOMINATING NEIGHBORHOOD SYSTEMS, RATIONAL WEIGHT OF A GRAPH, CONNECTED DOMINATING INDEPENDENT NEIGHBORHOOD POLYNOMIAL OF GRAPHS, STAR POLYNOMIAL OF THE CORONA OF GRAPHS, INDUCED PATH POLYNOMIAL OF GRAPHS, Almost self-complementary circulant graphs., Heavy cycles in \(k\)-connected weighted graphs with large weighted degree sums, Julius Petersen 1839--1910. A biography, An integer programming approach to the time slot assignment problem in SS/TDMA systems with intersatellite links, Encoding Hamiltonian circuits into multiplicative linear logic, Covering weighted graphs by even subgraphs, Some optimization problems on weak-bisplit graphs, Exponentially many maximum genus embeddings and genus embeddings for complete graphs, Universal graphs with forbidden subgraphs and algebraic closure, The enumeration of self-complementary \(k\)-multigraphs, \((k,g)\)-cages are 3-connected, The maximum genus of graphs with diameter three, A note on the maximum genus of 3-edge-connected nonsimple graphs, The crossing number of the circular graph \(C(2m+2,m)\), A decomposition for a class of \((P_ 5,\overline{P}_ 5)\)-free graphs, On prime labellings
