scientific article; zbMATH DE number 1432797
From MaRDI portal
Publication:4947393
Recommendations
Cited in
(only showing first 100 items - show all)- On the Colin de Verdière number of graphs
- On graphs whose eternal vertex cover number and vertex cover number coincide
- Equitable d-degenerate Choosability of Graphs
- Graphs (networks) with golden spectral ratio
- A semigroup proof of the bounded degree case of S.B. Rao's conjecture on degree sequences and a bipartite analogue
- Centrality measures for node-weighted networks via line graphs and the matrix exponential
- On the structure and deficiency of k-trees with bounded degree
- Graph theory in Coq: minors, treewidth, and isomorphisms
- Perfect unit graphs of commutative Artinian rings
- Cayley factorization and the area principle
- Logical aspects of Cayley-graphs: the group case
- An existential locality theorem
- Combinatorial inversion in edge-weighted unicyclic graphs
- Independence polynomials of circulants with an application to music
- Colouring of cubic graphs by Steiner triple systems
- Hadwiger's conjecture for proper circular arc graphs
- Annulus graphs in \(\mathbb{R}^d\)
- Maximum induced forests in graphs of bounded treewidth
- Dominator coloring and CD coloring in almost cluster graphs
- Triangle-factors in powers of graphs
- Block-indifference graphs: characterization, structural and spectral properties
- Forbidden induced subgraphs for star-free graphs
- The smooth structure of the moduli space of a weighted series-parallel graph
- Survey on regularity of symbolic powers of an edge ideal
- Two Fraïssé-style theorems for homomorphism-homogeneous relational structures
- On degree sequences of undirected, directed, and bidirected graphs
- Three-dimensional right-angled polytopes of finite volume in the Lobachevsky space: combinatorics and constructions
- Consensus in networks with arbitrary time invariant linear agents
- Combinatorial characterizations of the Cohen-Macaulayness of the second power of edge ideals
- Short Cycle Covers of Cubic Graphs and Intersecting 5-Circuits
- Graphs on all vertices and edges
- Edge fault-tolerance of strongly Menger edge connected graphs
- An approach to the performance of SPC product codes on the erasure channel
- Counting the number of non-equivalent vertex colorings of a graph
- Planarity and outerplanarity indexes of the zero-divisor graphs
- Communication complexity of pairs of graph families with applications
- Extremal graphs for Estrada indices
- Signed graphs with stable maximum nullity at most two
- On the Aα spectrum of the zero-divisor graphs
- scientific article; zbMATH DE number 1518742 (Why is no real title available?)
- Every planar graph is 1-defective \((9,2)\)-paintable
- External-memory depth-first search algorithm for solid grid graphs
- Bounds on isoperimetric values of trees
- 3-Regular subgraphs and (3,1)-colorings of 4-regular pseudographs
- Fan-crossing free graphs and their relationship to other beyond-planar graphs
- On the characteristic polynomial of the power of a path
- Colorings of hypergraphs, perfect graphs, and associated primes of powers of monomial ideals
- Skeleton matching polytope: realization and isomorphism
- Mixed partition functions and exponentially bounded edge-connection rank
- Enumerating non-crossing minimally rigid frameworks
- Scaled consensus of second-order multi-agent systems based on edge-event driven control
- Circular flow number of Goldberg snarks
- Some fixed point results on a metric space with a graph
- Directed path-decompositions
- Fano colourings of cubic graphs and the Fulkerson conjecture
- The contraction principle for set valued mappings on a metric space with a graph
- On immersions of uncountable graphs
- Drazin inverse of singular adjacency matrices of directed weighted cycles
- Flow-continuous mappings -- the influence of the group
- Note on the subgraph component polynomial
- A note on vertex colorings of plane graphs
- Some deterministic and random fixed point theorems on a graph
- Parameterized graph cleaning problems
- Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs
- About graph unions and intersections
- On compact and efficient routing in certain graph classes
- Group flow, complex flow, unit vector flow, and the (2 + )-flow conjecture
- Towards a polynomial kernel for directed feedback vertex set
- Hajós' theorem for list coloring
- Feedback robustness in structured closed-loop system
- On monochromatic arm exponents for 2D critical percolation
- Stanley-Reisner rings with large multiplicities are Cohen-Macaulay
- Matrix functions in network analysis
- A generalization of Tutte's theorem on Hamiltonian cycles in planar graphs
- Towards a polynomial kernel for directed feedback vertex set
- Perfect matchings with restricted intersection in cubic graphs
- Sum-list-colouring of \(\theta \)-hypergraphs
- Line-graphs of cubic graphs are normal
- Highly Connected Subgraphs with Large Chromatic Number
- Refined finiteness and degree properties in graphs
- \textsc{Telephone Broadcast} on graphs of treewidth two
- Improved bounds for the excluded-minor approximation of treedepth
- Moduli of hybrid curves. I: Variations of canonical measures
- A multiestimation-based scheme for modelling single-input-single-output discrete adaptive control systems
- Level property of ordinary and symbolic powers of Stanley-Reisner ideals
- Entire colouring of plane graphs
- Odd induced subgraphs in graphs with treewidth at most two
- Acyclic sum-list-colouring of grids and other classes of graphs
- Prescribed edges and forbidden edges for a cycle in a planar graph
- On a base exchange game on bispanning graphs
- Optimal selection of essential interconnections for structural controllability in heterogeneous subsystems
- Testing subgraphs in directed graphs
- Upper and lower bounds for finding connected motifs in vertex-colored graphs
- Effective feature construction by maximum common subgraph sampling
- Computing inertia sets using atoms
- Topics in structural graph theory
- A flow network analysis of direct balance-sheet contagion in financial networks
- Unmixedness of some weighted oriented graphs
- On the limiting behavior of parameter-dependent network centrality measures
- An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs
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 Q4947393)
