scientific article; zbMATH DE number 1118889

Publication date: 17 February 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Combinatorial aspects of matroids and geometric lattices (05B35) Directed graphs (digraphs), tournaments (05C20) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Graph theory (05Cxx)

Related Items

Dichotomizing \(k\)-vertex-critical \(H\)-free graphs for \(H\) of order four ⋮ Low‐cost minimum‐time line‐broadcasting schemes in complete binary trees ⋮ Random channel assignment in the plane ⋮ The Complement Graph for Gaussian Integers Modulon ⋮ The Kashaev equation and related recurrences ⋮ Unnamed Item ⋮ Strong Sard conjecture and regularity of singular minimizing geodesics for analytic sub-Riemannian structures in dimension 3 ⋮ Unnamed Item ⋮ Snakes: Legal, Illegal and Dodecahedral ⋮ Unnamed Item ⋮ On the Laplacian Szeged Spectrum of Paths ⋮ On the vertex covering sets and vertex cover polynomials of square of ladder graph ⋮ Bounding the \(HL\)-index of a graph: a majorization approach ⋮ THE CONNECTED NEIGHBOURHOOD POLYNOMIAL OF CORONA OF GRAPHS ⋮ Distributive lattices with strong endomorphism kernel property as direct sums ⋮ Generalized Entailments ⋮ Miscellaneous graph preliminaries. I ⋮ Packing complete multipartite graphs with 4-cycles ⋮ Extending the disjoint-representatives theorems of Hall, Halmos, and Vaughan to list-multicolorings of graphs ⋮ Classification of commutative zero-divisor semigroup graphs ⋮ Line-graph lattices: Euclidean and non-Euclidean flat bands, and implementations in circuit quantum electrodynamics ⋮ On the fold thickness of graphs ⋮ Introduction to graph enumerations ⋮ Bounds for the Kirchhoff index via majorization techniques ⋮ Uniqueness of best proximity pairs and rigidity of semimetric spaces ⋮ DISTALITY RANK ⋮ CHROMATIC POLYNOMIALS OF n-CENTIPEDE AND TRIANGULAR SNAKE TSn GRAPHS ⋮ Hamiltonicity and Eulerianity of Some Bipartite Graphs Associated to Finite Groups ⋮ Topological representations of simplicial complexes and their applications ⋮ Invariant synchrony and anti-synchrony subspaces of weighted networks ⋮ Network topology and self-consistency in language games ⋮ Hausdorff of a cycle in topological graph ⋮ Path-factorizations of complete bipartite multigraphs ⋮ An improvement on the Rado bound for the centerline depth ⋮ How to choose your relations ⋮ A note on the issue of cohesiveness in canonical models ⋮ Roots of Ehrhart polynomials arising from graphs ⋮ Smith normal form of some distance matrices ⋮ A model of a human heart via graph nano topological spaces ⋮ Dualizing distance-hereditary graphs ⋮ Unnamed Item ⋮ Edge crossings in random linear arrangements ⋮ Some properties of the intersection graph for finite commutative principal ideal rings ⋮ Neighborhood hypergraphs of bipartite graphs ⋮ SOME PROPERTIES OF THE ZERO-DIVISOR GRAPH FOR THE RING OF GAUSSIAN INTEGERS MODULO n ⋮ Ramsey Goodness of Bounded Degree Trees ⋮ Unbalanced star-factorizations of complete bipartite graphs. II ⋮ On rooks, marriages, and matchings or Steinhaus via Hall ⋮ Smooth Fano polytopes arising from finite directed graphs ⋮ On the line graph for zero-divisors of \(C(X)\) ⋮ The cubic power graph of finite abelian groups ⋮ Unnamed Item ⋮ A graph theoretic method for determining generating sets of prime ideals in quantum matrices ⋮ Sparse universal graphs for bounded‐degree graphs ⋮ On the chromatic spectrum of acyclic decompositions of graphs ⋮ Clustering with \(r\)-regular graphs ⋮ Nondisconnecting disentanglements of amalgamated 2-factorizations of complete multipartite graphs ⋮ Quasi‐random graphs with given degree sequences ⋮ Unbalanced bipartite factorizations of complete bipartite graphs ⋮ Connected searching of weighted trees ⋮ On the Hamiltonicity Gap and doubly stochastic matrices ⋮ The facility location problem with general cost functions ⋮ A self-stabilizing algorithm for constructing a minimal reachable directed acyclic graph with two senders and two targets ⋮ Adjacency in generalized projective Veronese spaces ⋮ Maximal vertex-connectivity of ⋮ HOW TO COUNT TREES? ⋮ Graph homomorphisms through random walks ⋮ Chromatic neighborhood sets ⋮ Optimal broadcasting with universal lists based on competitive analysis* ⋮ Adjacency Method for Finding Connected Subsets of a Graph: An Application of Graph Theory to Spatial Statistics ⋮ Long-Term Dynamics of Autonomous Fractional Differential Equations ⋮ The last excluded case of Dirac's map‐color theorem for choosability ⋮ Signed graph factors and degree sequences ⋮ A discrete districting plan ⋮ Commutative Zero-divisor Semigroups of Graphs with at Most Four Vertices ⋮ CHROMATIC POLYNOMIALS OF K_{m}+P_{n}, K_{m}+C_{n} AND G\circ H ⋮ Underlying simple graphs ⋮ About graph mappings ⋮ About vertex mappings ⋮ Geometric interpretation of Hamiltonian cycles problem via singularly perturbed Markov decision processes ⋮ Some exceptional cases in mathematics: euler characteristic, division algebras, cross vector product and fano matroid ⋮ Error-correcting codes from permutation groups ⋮ Unnamed Item ⋮ List multicolorings of graphs with measurable sets ⋮ Unnamed Item ⋮ From graph theory to nano topology ⋮ Some topological structures of fractals and their related graphs ⋮ Exponential synchronization of stochastic coupled oscillators networks with delays ⋮ Avoidability index for binary patterns with reversal ⋮ Some colouring problems for Paley graphs