Graph theory
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- The category of node-and-choice preforms for extensive-form games
- Leader selection problem for stochastically forced consensus networks based on matrix differentiation
- Shortest circuit covers of signed graphs
- Binary constraint satisfaction problems defined by excluded topological minors
- Treewidth distance on phylogenetic trees
- Leaf realization problem, caterpillar graphs and prefix normal words
- Maximal determinants of combinatorial matrices
- An octree-based adaptive semi-Lagrangian VOF approach for simulating the displacement of free surfaces
- Random enriched trees with applications to random graphs
- Subclass graph embedding and a marginal Fisher analysis paradigm
- Simple graphs in granular computing
- Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions
- Finding even subgraphs even faster
- Nodal statistics on quantum graphs
- On Deza graphs with disconnected second neighborhood of a vertex
- Asynchronous periodic event-triggered consensus for multi-agent systems
- An excluded minors method for infinite matroids
- Discrete analogue of generalized Hardy spaces and multiplication operators on homogenous trees
- On imposing connectivity constraints in integer programs
- Adaptive AMG with coarsening based on compatible weighted matching
- Six variations on a theme: almost planar graphs
- Multiple weak 2-linkage and its applications on integer flows of signed graphs
- Ends and tangles
- Invariant subsets of scattered trees and the tree alternative property of Bonato and Tardif
- \(K_4\)-expansions have the edge-Erdős-Pósa property
- On the difference between Hamilton cycles and 2-factors with a prescribed number of cycles
- On the existence of vertex-disjoint subgraphs with high degree sum
- Terminal-pairability in complete bipartite graphs
- Uniformly resolvable cycle decompositions with four different factors
- Generalised Ramsey numbers for two sets of cycles
- Overview of shelling for 2-manifold surface reconstruction based on 3D Delaunay triangulation
- 2-complexes with large 2-girth
- Max-linear models on directed acyclic graphs
- Approximating (unweighted) tree augmentation via lift-and-project. I: Stemless TAP
- Approximating (unweighted) tree augmentation via lift-and-project. II
- \(k\)-centric Turán numbers and multi-color Ramsey numbers for a loose 3-uniform path of length 3
- Structure of edges in a 4-connected graph not contained in triangles and the number of contractible edges
- Mobile versus point guards
- The existence of \(f\)-forests and \(f\)-trees in graphs
- The graph Ramsey number R(F_, K₆)
- Degree sum and graph linkage with prescribed path lengths
- Paired-domination in claw-free graphs with minimum degree at least three
- Gallai's path decomposition conjecture for triangle-free planar graphs
- Bipartite graphs and monochromatic squares
- Sum-perfect graphs
- Computing metric dimension of compressed zero divisor graphs associated to rings
- Reset control for synchronization of multi-agent systems
- Explicit linear kernels for packing problems
- Mining rooted ordered trees under subtree homeomorphism
- The complexity of routing with collision avoidance
- LDPC codes from \(\mu\)-geodetic graphs obtained from block designs
- Signature of power graphs
- Problems on matchings and independent sets of a graph
- On the intersection of infinite matroids
- Computational complexity of the vertex cover problem in the class of planar triangulations
- A unified treatment of linked and lean tree-decompositions
- Binomial edge ideals of bipartite graphs
- Decomposing highly connected graphs into paths of length five
- The existence of a path-factor without small odd paths
- A better lower bound on average degree of online \(k\)-list-critical graphs
- Hamilton circles in Cayley graphs
- Lower bound on the number of contractible edges in a 4-connected graph with edges not contained in triangles
- A characterization of domination weak bicritical graphs with large diameter
- The matching extendability of optimal 1-planar graphs
- Enomoto and Ota's conjecture holds for large graphs
- The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs
- Model completeness of generic graphs in rational cases
- Unique factorization of tensor products for Kac-Moody algebras
- NP-hardness and fixed-parameter tractability of the minimum spanner problem
- Non-reconstructible locally finite graphs
- Edges incident with a vertex of degree greater than four and a lower bound on the number of contractible edges in a 4-connected graph
- Encoding and avoiding 2-connected patterns in polygon dissections and outerplanar graphs
- Independent-set reconfiguration thresholds of hereditary graph classes
- Hypertree-depth and minors in hypergraphs
- On the excluded minor structure theorem for graphs of large tree-width
- Hardness of approximation for crossing number
- Embeddability between right-angled Artin groups..
- Searchability of central nodes in networks
- The biased odd cycle game
- On the intersection conjecture for infinite trees of matroids
- Notes on diagonals of the product and symmetric variety of a surface
- Isomorphisms of \(AC(\sigma)\) spaces for linear graphs
- Pairings and related symmetry notions
- On the structure of oriented graphs and digraphs with forbidden tournaments or cycles
- Homomorphism bounds and edge-colourings of \(K_{4}\)-minor-free graphs
- Robustness on topology reconfiguration of complex networks: an entropic approach
- Domination and efficient domination in cubic and quartic Cayley graphs on abelian groups
- Dependency relations
- Enlargement of subgraphs of infinite graphs by Bernoulli percolation
- Placing specified vertices at precise locations on a Hamiltonian cycle
- On sums of graph eigenvalues
- A graph library for Isabelle
- Searching for square-complementary graphs: complexity of recognition and further nonexistence results
- Constructing separable Arnold snakes of Morse polynomials
- On extendability of co-edge-regular graphs
- On structural parameterizations of the edge disjoint paths problem
- Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization
- Flows on flow-admissible signed graphs
- Blocking total dominating sets via edge contractions
- Chromatic symmetric function of graphs from Borcherds algebras
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 Q3577833)
