scientific article
From MaRDI portal
Publication:3992521
zbMath0684.05015MaRDI QIDQ3992521
Publication date: 17 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Trees (05C05) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Combinatorial aspects of matroids and geometric lattices (05B35) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Graph theory (05Cxx)
Related Items
Entropy bounds for dendrimers, A class of graphs each tolerance graph of which is a bounded one, Short disjoint cycles in graphs with degree constraints, Gallai graphs and anti-Gallai graphs, A history of graph entropy measures, A computational approach to construct a multivariate complete graph invariant, Towards detecting structural branching and cyclicity in graphs: a polynomial-based approach, Tree-partitions of infinite graphs, Lattices of cuts in graphs, Some finiteness results concerning separation in graphs, A comparative analysis of multidimensional features of objects resembling sets of graphs, Inequalities for entropy-based measures of network information content, Short disjoint cycles in graphs with degree constraints, Structural similarity of directed universal hierarchical graphs: a low computational complexity approach, Highly unique network descriptors based on the roots of the permanental polynomial, On the clique-transversal number of chordal graphs, Semigroups of linear endomorphisms closed under conjugation, A note on partial 3-trees and homomorphism bases of graphs
