scientific article; zbMATH DE number 3290993
From MaRDI portal
Publication:5572939
Recommendations
Cited in
(only showing first 100 items - show all)- \(e\): the master of all
- Dynamic graphs
- Laplacian spectrum of weakly quasi-threshold graphs
- Open rectangle-of-influence drawings of inner triangulated plane graphs
- Limit laws for the Randić index of random binary tree models
- On \(\Sigma\) and \(\Sigma'\) labelled graphs
- Higmanian rank-5 association schemes on 40 points
- Inclusion relations of certain graph eigenspaces
- Fullerene graphs with exponentially many perfect matchings
- Vertex and edge covers with clustering properties: Complexity and algorithms
- Retro-leapfrog and structure elucidation
- Subgraphs of pair vertices
- Tubercular fulleroids
- Cartesian product of the universal covering property
- Is VAT really single linkage in disguise?
- Flow analysis sensitivities for models of energy or material flow
- Posets and generalized lattices
- On the complexity of graphs and molecules
- Minimizing the jump number for partially ordered sets: A graph-theoretic approach
- Distance degree regular graphs
- Counting labelled chordal graphs
- A formalization of consensus index methods
- A note on similar edges and edge-unique line graphs
- Note on the regular digraphs
- Automates finis et ensembles normaux. (Finite automata and normal sets)
- Randomly n-cyclic digraphs
- On 1-factorizability of Cayley graphs
- The generation of random, binary unordered trees
- On the regulation number of a multigraph
- Spins and fermions on arbitrary lattices
- On the T(q)-conditions of small cancellation theory
- The theorem on planar graphs
- Optimal algorithms for comparing trees with labeled leaves
- Generalized Steiner problem in outerplanar networks
- n-connectedness in pure 2-complexes
- Hamiltonian decompositions of complete regular s-partite graphs
- Construction of finite p-groups with prescribed group of noncentral automorphisms
- The binding number of line graphs and total graphs
- Enumeration of projective-planar embeddings of graphs
- Goodness of trees for generalized books
- Handles in graphs and sphere bundles over S^ 1
- Two theorems on packings of graphs
- A graph-theoretical representation of PL-manifolds -- a survey on crystallizations
- Line domination in graphs
- Grids and their minors
- On approximation behavior of the greedy triangulation for convex polygons
- Ein Henkeltheorem für geschlossene semilineare Mannigfaltigkeiten. (A handle theorem for closed semilinear manifolds)
- On the Euclidean dimension of a wheel
- Multiple residues in dimension three
- Covering and packing in graphs. V. Mispacking subcubes in hypercubes
- The analysis of a nested dissection algorithm
- A characterization of undirected branching greedoids
- Designing networks with compact routing tables
- On well-quasi-ordering-finite graphs by immersion
- On the use of ordered sets in problems of comparison and consensus of classifications
- Matching extension and the genus of a graph
- A polynomial characterization of some graph partitioning problems
- Trivalent orbit polynomial graphs
- Bigeodetic graphs
- INGRID: A graph invariant manipulator
- The total interval number of a graph
- On the genus of the complex projective plane
- Generalized handles in graphs and connected sums of manifolds
- Suboptimal cycle bases of graphs for the flexibility analysis of skeletal structures
- An upper bound on the shortness exponent of inscribable polytopes
- Ein Beitrag zur Ulam-Vermutung
- An algorithm for hierarchical reduction and decomposition of a directed graph
- Flows and generalized coloring theorems in graphs
- Minimal separating sets of maximum size
- Neural languages
- The book thickness of a graph
- Some perfect coloring properties of graphs
- Critically partitionable graphs. I
- Infinite subgraphs as matroid circuits
- Some counterexamples associated with the three-color problem
- Hamiltonian-connected tournaments
- Panarboreal graphs
- Combinatorially symmetric matrices
- Planarity and duality of finite and infinite graphs
- Erdős-Hajnal well-orderings and n-degenerate graphs
- The asymptotic distribution of short cycles in random regular graphs
- The asymptotic connectivity of labelled regular graphs
- Neighbourhoods of transitive graphs and GRR's
- Which trees are link graphs?
- The group and the minimal polynomial of a graph
- A characterization of 3-connected graphs containing a given graph
- Graphs with certain families of spanning trees
- Graph factorization, general triple systems, and cyclic triple systems
- Reconstruction theorems for graph enumerating polynomials
- On the number of subgraphs of prescribed type of graphs with a given number of edges
- The smallest 2-connected cubic bipartite planar nonhamiltonian graph
- On the number of complete subgraphs contained in certain graphs
- A graph theoretic approach to multivariable control system design
- More balanced ternary designs with block size three
- A note on the circuit polynomials and characteristic polynomials of wheels and ladders
- Bounds on the number of cycles of length three in a planar graph
- Equational classes of distributive double p-algebras
- An effective structured approach to finding optimal partitions of networks
- Some general constructions of geodetic blocks
- Universal caterpillars
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5572939)
