scientific article; zbMATH DE number 5776838
From MaRDI portal
Publication:3586724
Cited in
(46)- Topological infinite gammoids, and a new Menger-type theorem for infinite graphs
- Bounds on the burning number
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
- The flip Markov chain for connected regular graphs
- An extension of the Christofides heuristic for the generalized multiple depot multiple traveling salesmen problem
- The smallest self-dual embeddable graphs in a pseudosurface
- Upper bound on the diameter of a domination dot-critical graph
- Geodesic continued fractions
- Strengthened chain theorems for different versions of 4-connectivity
- Computing vertex-disjoint paths in large graphs using MAOs
- Distributed secondary frequency control in microgrids: robustness and steady-state performance in the presence of clock drifts
- Sharp separation and applications to exact and parameterized algorithms
- Nearly exact mining of frequent trees in large networks
- Classification of spherical tilings by congruent quadrangles over pseudo-double wheels. I: A special tiling by congruent concave quadrangles
- On the fine-grained complexity of rainbow coloring
- A simplex method for uncapacitated pure-supply infinite network flow problems
- Some classes of perfect strongly annihilating-ideal graphs associated with commutative rings
- A stronger bound for the strong chromatic index
- Cycle flows and multistability in oscillatory networks
- The strong 3-rainbow index of edge-amalgamation of some graphs
- Hybrid tractable classes of constraint problems
- Two-ended quasi-transitive graphs
- scientific article; zbMATH DE number 7561610 (Why is no real title available?)
- scientific article; zbMATH DE number 7561704 (Why is no real title available?)
- Tight lower bounds for the complexity of multicoloring
- Embedding Graphs into Embedded Graphs
- On multiaspect graphs
- Multistability in lossy power grids and oscillator networks
- First-Order Convergence and Roots
- A UNIFIED THEORY OF TRUTH AND PARADOX
- Some classifications of graphs with respect to a set adjacency relation
- First-Order Model-Checking in Random Graphs and Complex Networks
- An Improved Approximation Algorithm for the Matching Augmentation Problem
- Every rayless graph has an unfriendly partition
- The hardness of recognising poorly matchable graphs and the hunting of the \(d\)-snark
- Dual communities characterize structural patterns and robustness in leaf venation networks
- Minimum spanning trees in infinite graphs: theory and algorithms
- Tree coloring with predictions
- The next smallest self-dual embeddable graphs in pseudosurfaces
- Ground state properties of the SSH model
- Topology of matching complexes of complete graphs via discrete Morse theory
- Generalized domination structure in cubic graphs
- Cycle conditions for ``Luce rationality
- Pliability and approximating Max-CSPs
- The injective chromatic index of planar graphs with maximum degree 4
- Dual parameterization of weighted coloring
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 Q3586724)
