scientific article; zbMATH DE number 2203240
From MaRDI portal
Publication:5315023
Recommendations
Cited in
(only showing first 100 items - show all)- Conflict-free coloring bounds on open neighborhoods
- Induced-universal graphs for graphs with bounded maximum degree
- Evaluation of the copycat model for predicting complex network growth
- Colouring of graphs with Ramsey-type forbidden subgraphs
- Graphs with equal chromatic symmetric functions
- On Injective Colourings of Chordal Graphs
- Multiswapped networks and their topological and algorithmic properties
- On the critical ideals of graphs
- A unified approach to distance-two colouring of graphs on surfaces
- Communication constraints in the average consensus problem
- Optimum distance flag codes from spreads via perfect matchings in graphs
- On the sizes of graphs and their powers: the undirected case
- Control of multiagent networks with misbehaving nodes
- A magic rectangle set on abelian groups and its application
- Maximal strongly connected cliques in directed graphs: algorithms and bounds
- Efficient enumeration of maximal \(k\)-degenerate induced subgraphs of a chordal graph
- Approximation of knapsack problems with conflict and forcing graphs
- Graph topologies induced by edge lengths
- On graphs of defect at most 2
- Dynamic programming for graphs on surfaces
- Threshold-based preprocessing for approximating the weighted dense \(k\)-subgraph problem
- Uniform even subgraphs and graphical representations of Ising as factors of i.i.d.
- Explaining hierarchical multi-linear models
- A characterization of the locally finite networks admitting non-constant harmonic functions of finite energy
- On maximal cliques with connectivity constraints in directed graphs
- A New Characterization of P 6-Free Graphs
- The geometric spectrum of a graph and associated curvatures
- On induced-universal graphs for the class of bounded-degree graphs
- Additive bases and flows in graphs
- Approximately interpolating between uniformly and non-uniformly polynomial kernels
- Lazy constraint imposing for improving the path constraint
- A short proof of Fleischner's theorem
- Parameterized complexity of the spanning tree congestion problem
- Optimal cuts and partitions in tree metrics in polynomial time
- Delay colourings of cubic graphs
- On the homology of locally compact spaces with ends
- Graph classes and Ramsey numbers
- Recent advances in unfolding technique
- Exponentially many hypohamiltonian snarks
- Characterizing 2-crossing-critical graphs
- A survey of the studies on Gallai and anti-Gallai graphs
- A new proof of the flat wall theorem
- On the double Roman domination of graphs
- The excluded minors for embeddability into a compact surface
- Graph-like continua, augmenting arcs, and Menger's theorem
- Exact solutions for latency-bounded target set selection problem on some special families of graphs
- The boundary of a square tiling of a graph coincides with the Poisson boundary
- Analyzing the maritime transportation system in Greece: a complex network approach
- Complexity and monotonicity results for domination games
- Antimagic labeling graphs with a regular dominating subgraph
- Embedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and links
- On a labeling problem in graphs
- Random eigenvalues of nanotubes
- A self-stabilizing algorithm for cut problems in synchronous networks
- The homology of a locally finite graph with ends
- UPS delivers optimal phase diagram in high-dimensional variable selection
- Coarse differentiation and multi-flows in planar graphs
- Transitivity on subclasses of bipartite graphs
- Cluster editing with vertex splitting
- Subdivisions in apex graphs
- CPG graphs: some structural and hardness results
- A polynomial time algorithm to compute the connected treewidth of a series-parallel graph
- On structural parameterizations of load coloring
- Breaking graph symmetries by edge colourings
- scientific article; zbMATH DE number 1432797 (Why is no real title available?)
- Which \(k\)-trees are cover-incomparability graphs?
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- Quantifying sequential subsumption
- Graph theory and its applications
- Absorption probabilities of quantum walks
- Arboricity and tree-packing in locally finite graphs
- Uniform hyperbolicity of the graphs of curves
- Rank functions on rooted tree quivers.
- Are there any good digraph width measures?
- 3-coloring \(C_4\) or \(C_3\)-free diameter two graphs
- On self-affine tiles that are homeomorphic to a ball
- Colouring vertices of triangle-free graphs without forests
- Deterministic Leader Election in Programmable Matter
- On graphs isomorphic to their neighbour and non-neighbour sets
- Polynomial time algorithms for computing a minimum hull set in distance-hereditary and chordal graphs
- Pursuing a fast robber on a graph
- Representation of \(k\)-mer sets using spectrum-preserving string sets
- A topological approach of a human heart via nano pre-ideality
- Spanning trees of \(K_{1,4}\)-free graphs with a bounded number of leaves and branch vertices
- Group distance magic Cartesian product of two cycles
- Characterising \(3\)-polytopes of radius one with unique realisation
- Vertex partitioning problems on graphs with bounded tree width
- On the edge metric dimension of graphs
- On graphs with few disjoint \(t\)-star minors
- Matchings and independent sets of a fixed size in regular graphs
- Fast Robber in Planar Graphs
- Clustering dynamics of nonlinear oscillator network: Application to graph coloring problem
- Cycle decompositions: from graphs to continua
- On semiextensions and circuit double covers
- The dag-width of directed graphs
- A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs
- Hamiltonian cycles with all small even chords
- The Bers's constant in genus two
- On the uncontrollability of nonabelian group codes with uncoded group \(\mathbb Z_p\)
- Unique (optimal) solutions: complexity results for identifying and locating-dominating codes
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 Q5315023)
