Recommendations
Cited in
(only showing first 100 items - show all)- On perfect annihilator graphs of commutative rings
- Approximating branchwidth on parametric extensions of planarity
- Treewidth is a lower bound on graph gonality
- On pro-\(p\) groups with quadratic cohomology
- Sparse hop spanners for unit disk graphs
- Consequences of the packing problem
- A tree-of-tangles theorem for infinite tangles
- A study of the generalized outerplanar index of zero-divisor graphs
- Enlarging vertex-flames in countable digraphs
- How many variables are needed to express an existential positive query?
- Labeled trees generating complete, compact, and discrete ultrametric spaces
- An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength
- Generalized coefficients of clustering in (un)directed and (un)weighted networks: an application to systemic risk quantification for cryptocoin markets
- Musical stylistic analysis: a study of intervallic transition graphs via persistent homology
- The multicolored graph realization problem
- Edges incident with a vertex of degree greater than four and the number of contractible edges in a 4-connected graph
- An analogue of Edmonds' branching theorem for infinite digraphs
- Upper tails via high moments and entropic stability
- ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS
- Identifiability of local and global features of phylogenetic networks from average distances
- Groups of \(p\)-absolute Galois type that are not absolute Galois groups
- The lattice of cycles of an undirected graph
- Disjoint cycles covering specified vertices in bipartite graphs with partial degrees
- Lower bounds and properties for the average number of colors in the non-equivalent colorings of a graph
- Weak degeneracy of graphs
- Propagation tree decompositions and linearly independent vertices
- Fermat's last theorem implies Euclid's infinitude of primes
- scientific article; zbMATH DE number 7453155 (Why is no real title available?)
- Realizable ranks of joins and intersections of subgroups in free groups
- An algebraic formulation of hypergraph colorings
- Tangle-tree duality in abstract separation systems
- On graph norms for complex‐valued functions
- Edge-wise funnel output synchronization of heterogeneous agents with relative degree one
- Tree-like graphings, wallings, and median graphings of equivalence relations
- Links in projective planar graphs
- Trees of tangles in infinite separation systems
- The presentation of deterministic and strongly deterministic graphs
- Partitioning vertices of graphs into paths of the same length
- Homomorphisms of Cayley graphs and cycle double covers
- Pendant appearances and components in random graphs from structured classes
- A Coxeter type classification of one-peak principal posets
- New constructions of divisible design Cayley graphs
- About path and cycle graphs
- Zero-temperature stochastic Ising model on planar quasi-transitive graphs
- On reconfiguration graphs of independent sets under token sliding
- Vertex cover and feedback vertex set above and below structural guarantees
- The poset of graphs ordered by induced containment
- Two step graph protection game
- On polynomial kernels for traveling salesperson problem and its generalizations
- Distributed distance-\(r\) covering problems on sparse high-girth graphs
- Minimal induced subgraphs of the class of 2-connected non-Hamiltonian wheel-free graphs
- Antimagic labeling of biregular bipartite graphs
- The complexity of distance-r dominating set reconfiguration
- An optimal absolute approximation algorithm for computing k restricted shortest paths
- A lower bound on the zero forcing number
- Large \(Y_{3,2}\)-tilings in 3-uniform hypergraphs
- Theoretical aspects of equitable partition of networks into sparse modules
- Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization
- Three families of toric rings arising from posets or graphs with small class groups
- Multigraph edge-coloring with local list sizes
- The minor order of homomorphisms via natural dualities
- Proximity semantics for topic-based abstract argumentation
- Planarity of Cayley graphs of graph products of groups
- A safeness condition for minimal separators based on vertex connectivity
- E_A-cordial labeling of graphs and its implications for A-antimagic labeling of trees
- Abstract separation systems
- Tree sets
- Maximally edge‐connected realizations and Kundu's k $k$‐factor theorem
- Rooted minors and locally spanning subgraphs
- Entanglements
- On the Erdős–Pósa Property for Long Holes in \(\boldsymbol{C_4}\)-Free Graphs
- Nonabelian flows in networks
- Projective dimension of weakly chordal graphic arrangements
- On the role of 3's for the 1-2-3 conjecture
- Linkedness of Cartesian products of complete graphs
- Product structure of graph classes with bounded treewidth
- Trees of tangles in abstract separation systems
- Flexible List Colorings in Graphs with Special Degeneracy Conditions
- Distribution of vertices required a high-degree condition on partitions of graphs under degree constraints
- On the Parameterized Complexity of the Expected Coverage Problem
- Rooted complete minors in line graphs with a Kempe coloring
- Divisible design Cayley digraphs
- The Dirichlet problem for orthodiagonal maps
- Stars in forbidden triples generating a finite set of graphs with minimum degree four
- Local Hadwiger's conjecture
- The distance matching extension in \(K_{1,k}\)-free graphs with high local connectedness
- All subgraphs of a wheel are 5-coupled-choosable
- Sums of squares and quadratic persistence on real projective varieties
- Two-disjoint-cycle-cover pancyclicity of data center networks
- A characterization of graphs with regular distance-2 graphs
- Canonical trees of tree-decompositions
- Equitable choosability of prism graphs
- \(n\)-arc connected graphs
- Geometry and Combinatorics via Right-Angled Artin Groups
- A fast distributed algorithm for \((\Delta+1)\)-edge-coloring
- Locally Finite ultrametric spaces and labeled trees
- k-fault-tolerant graphs for p disjoint complete graphs of order c
- Zero-memory graph exploration with unknown inports
- Hypergraph operations preserving sc-greediness
- Graph grabbing game on graphs with forbidden subgraphs
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)
