Graph theory
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Reconfiguration on nowhere dense graph classes
- Consensus and voting on large graphs: an application of graph limit theory
- Extremum seeking based fault-tolerant cooperative control for multiagent systems
- On contact graphs of paths on a grid
- Metric currents and the Poincaré inequality
- Counting linear extensions: parameterizations by treewidth
- Rooted complete minors in line graphs with a Kempe coloring
- The geometry of partial fitness orders and an efficient method for detecting genetic interactions
- Parameterized algorithms for conflict-free colorings of graphs
- A lower bound on the zero forcing number
- Seminormality, canonical modules, and regularity of cut polytopes
- Finding temporal paths under waiting time constraints
- Existence of a spanning tree having small diameter
- Enlarging vertex-flames in countable digraphs
- Long cycles, heavy cycles and cycle decompositions in digraphs
- Proximity semantics for topic-based abstract argumentation
- Planarity of Cayley graphs of graph products of groups
- Higher cyclic operads
- The Dirichlet problem for orthodiagonal maps
- Connectivity of cubical polytopes
- Vertex-facet assignments for polytopes
- Bottleneck subset-type restricted matching problems
- Tilings from graph directed iterated function systems
- A characterization of trees based on edge-deletion and its applications for domination-type invariants
- Theoretical aspects of equitable partition of networks into sparse modules
- A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs
- A new proof of Balinski's theorem on the connectivity of polytopes
- Improved bounds on the Ramsey number of fans
- Fractal dimension and lower bounds for geometric problems
- Unavoidable minors for graphs with large \(\ell_p\)-dimension
- Complexity of tree-coloring interval graphs equitably
- Faster algorithms for counting subgraphs in sparse graphs
- Simplicity of augmentation submodules for transformation monoids
- Distribution of contractible edges and the structure of noncontractible edges having endvertices with large degree in a 4-connected graph
- Achromatic number and facial achromatic number of connected locally-connected graphs
- Induced nets and Hamiltonicity of claw-free graphs
- The linkedness of cubical polytopes: the cube
- Hitting forbidden induced subgraphs on bounded treewidth graphs
- Distance matching extension in cubic bipartite graphs
- Analysis on Laakso graphs with application to the structure of transportation cost spaces
- On list \(k\)-coloring convex bipartite graphs
- New bounds for Ramsey numbers \(R ( K_k - e , K_l - e )\)
- New constructions of divisible design Cayley graphs
- The 2-partially distance-regular graphs such that their second largest local eigenvalues are at most one
- A Glazman-Povzner-Wienholtz theorem on graphs
- Fast algorithm of equitably partitioning degenerate graphs into graphs with lower degeneracy
- On the expected number of perfect matchings in cubic planar graphs
- Rigidity, weak mixing, and recurrence in abelian groups
- LDPC codes constructed from cubic symmetric graphs
- On pro-\(p\) groups with quadratic cohomology
- Analysis of the continuum with surreal numbers
- Excluding a ladder
- A characterization of graphs with regular distance-2 graphs
- Eternal vertex cover on bipartite graphs
- Identifiability of local and global features of phylogenetic networks from average distances
- Groups of \(p\)-absolute Galois type that are not absolute Galois groups
- Connectivity of triangulation flip graphs in the plane
- Reversible Markov decision processes and the Gaussian free field
- A tree-of-tangles theorem for infinite tangles
- Complexity and approximability of minimum path-collection exact covers
- Minimal induced subgraphs of the class of 2-connected non-Hamiltonian wheel-free graphs
- Antimagic labeling of biregular bipartite graphs
- The distance matching extension in \(K_{1,k}\)-free graphs with high local connectedness
- All subgraphs of a wheel are 5-coupled-choosable
- A multi-agent model for polarization under confirmation bias in social networks
- New limits of treewidth-based tractability in optimization
- Sums of squares and quadratic persistence on real projective varieties
- Uncountably many minimal hereditary classes of graphs of unbounded clique-width
- Proof of Halin's normal spanning tree conjecture
- Three families of toric rings arising from posets or graphs with small class groups
- Hamilton-laceable bi-powers of locally finite bipartite graphs
- On Dasgupta's hierarchical clustering objective and its relation to other graph parameters
- Graph invariants of the line graph of zero divisor graph of \(\mathbb{Z}_n \)
- Graph theory -- a survey on the occasion of the Abel Prize for László Lovász
- On a colored Turán problem of Diwan and Mubayi
- Aspects of topological approaches for data science
- On the feedback number of 3-uniform linear extremal hypergraphs
- Linear bounds for cycle-free saturation games
- Maximal chains in bond lattices
- Many faces of symmetric edge polytopes
- Equality of opportunity and integration in social networks
- Upper tails via high moments and entropic stability
- Purity results for some arithmetically defined measures
- Forbidden triples generating a finite set of graphs with minimum degree three
- The \(\mathbb{Z}_2\)-genus of Kuratowski minors
- On a construction by Giudici and Parker on commuting graphs of groups
- Harmless sets in sparse classes
- Using edge contractions and vertex deletions to reduce the independence number and the clique number
- Characterising \(k\)-connected sets in infinite graphs
- Sum-list colouring of unions of a hypercycle and a path with at most two vertices in common
- Partitioning edge-coloured infinite complete bipartite graphs into monochromatic paths
- Treewidth is a lower bound on graph gonality
- A unified existence theorem for normal spanning trees
- Parameterized algorithms for book embedding problems
- A study of the generalized outerplanar index of zero-divisor graphs
- Indecomposable continua as Higson coronae
- Propagation tree decompositions and linearly independent vertices
- Tangle-tree duality in abstract separation systems
- Port-Hamiltonian formulation of nonlinear electrical circuits
- Equitable list tree-coloring of bounded treewidth graphs
This page was built for publication: Graph theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829286)
