Graph theory
From MaRDI portal
Publication:3577833
Recommendations
Cited in
(only showing first 100 items - show all)- Terminal-pairability in complete bipartite graphs
- Kernel bounds for path and cycle problems
- The complexity of rerouting shortest paths
- Two short proofs of the bounded case of S. B. Rao's degree sequence conjecture
- On the difference between Hamilton cycles and 2-factors with a prescribed number of cycles
- Trees of nuclei and bounds on the number of triangulations of the 3-ball
- Gorenstein cut polytopes
- ALGEBRAIC STRUCTURES RELATED TO BALANCED FUNCTIONS ON GRAPHS: RESULTS AND OPEN PROBLEMS
- Graphs with two trivial critical ideals
- A generalization of Hungarian method and Hall's theorem with applications in wireless sensor networks
- Regularity of the vanishing ideal over a parallel composition of paths
- Rough Set Theory Applied to Simple Undirected Graphs
- Canonical tree-decompositions of finite graphs. II. Essential parts
- Odd \(K_{3,3}\) subdivisions in bipartite graphs
- Unavoidable induced subgraphs in large graphs with no homogeneous sets
- The minimality of the Georges-Kelmans graph
- Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
- Hyperbolic families and coloring graphs on surfaces
- Random Walks and Forbidden Minors II: A $\mathrm{poly}(d\varepsilon^{-1})$-Query Tester for Minor-Closed Properties of Bounded-Degree Graphs
- A degree sum condition for the existence of an \(S\)-path-system in a bipartite graph
- The parameterized complexity of the minimum shared edges problem
- Practical algorithms for MSO model-checking on tree-decomposable graphs
- Random geometric graphs and isometries of normed spaces
- scientific article; zbMATH DE number 3020563 (Why is no real title available?)
- On the maximum value of the eccentric distance sums of cubic transitive graphs
- A different short proof of Brooks' theorem
- Indiscernibility structures induced from function sets: graph and digraph case
- Conformal dimension and boundaries of planar domains
- Isomorphisms of \(AC(\sigma)\) spaces for linear graphs
- Random graphs from a weighted minor-closed class
- Robust synchronization of a class of chaotic networks
- Forbidden subgraphs and the existence of a 2-walk
- Finding clubs in graph classes
- Algorithms and topology of Cayley graphs for groups.
- Maximum number of colourings: 5-chromatic case
- Contractible non-edges in 3-connected infinite graphs
- The graph Ramsey number R(F_, K₆)
- Graphs on all vertices and edges
- 2-manifold tests for 3D Delaunay triangulation-based surface reconstruction
- Connectivity and tree structure in finite graphs
- Decompositions of graphs into trees, forests, and regular subgraphs
- Average degree conditions forcing a minor
- A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs
- Strong cliques and equistability of EPT graphs
- Parameterized algorithms for finding square roots
- On finding rainbow and colorful paths
- Connected searching of weighted trees
- A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs
- Hitting minors on bounded treewidth graphs. I: General upper bounds
- Problems and results on 1-cross-intersecting set pair systems
- scientific article; zbMATH DE number 7559376 (Why is no real title available?)
- A note on degree sum conditions for 2-factors with a prescribed number of cycles in bipartite graphs
- A greedy algorithm for finding maximum spanning trees in infinite graphs
- Flows of 3-edge-colorable cubic signed graphs
- The biased odd cycle game
- Quick but odd growth of cacti
- Edge proximity and matching extension in punctured planar triangulations
- Breakpoint distance and PQ-trees
- A branch‐and‐cut algorithm for a bipartite graph construction problem in digital communication systems
- Bounds on connective constants of regular graphs
- Limits of random tree-like discrete structures
- Asymptotic properties of random unlabelled block-weighted graphs
- Subclass graph embedding and a marginal Fisher analysis paradigm
- Unavoidable subtournaments in large tournaments with no homogeneous sets
- Approximating Pathwidth for Graphs of Small Treewidth
- Fine-grained parameterized complexity analysis of graph coloring problems
- On the Cucker-Smale flocking with alternating leaders
- Using contracted solution graphs for solving reconfiguration problems
- Covering contractible edges in 2-connected graphs
- The Complexity of Homomorphism Indistinguishability
- Large angle crossing drawings of planar graphs in subquadratic area
- Axioms for infinite matroids
- Graphs with coloring redundant edges
- STRONG KOSZULNESS OF TORIC RINGS ASSOCIATED WITH STABLE SET POLYTOPES OF TRIVIALLY PERFECT GRAPHS
- scientific article; zbMATH DE number 7561685 (Why is no real title available?)
- On the number of minimal separators in graphs
- Entanglement, flow and classical simulatability in measurement based quantum computation
- scientific article; zbMATH DE number 7561367 (Why is no real title available?)
- Rerouting shortest paths in planar graphs
- Degree sum and graph linkage with prescribed path lengths
- Bipartite graphs and monochromatic squares
- Nordhaus-Gaddum for treewidth
- Flows on flow-admissible signed graphs
- Weak models of distributed computing, with connections to modal logic
- Non-solvable groups whose character degree graph has a cut-vertex. I
- Neighborhood-union condition for an \([a, b]\)-factor avoiding a specified Hamiltonian cycle
- The structure of 2-separations of infinite matroids
- Analysing Multivariate Spatial Point Processes with Continuous Marks: A Graphical Modelling Approach
- Introduction
- Forcing a sparse minor
- On Lipschitz extension from finite subsets
- Estimating an extreme Bayesian network via scalings
- List-coloring claw-free graphs with \(\Delta-1\) colors
- Internally 4-connected graphs with no \(\{\text{cube}, V_8\}\)-minor
- The adjacency matrix of a graph as a data table: a geometric perspective
- Enumeration of balanced finite group valued functions on directed graphs
- SPN completable graphs
- On computational complexity of graph inference from counting
- Cospectral digraphs from locally line digraphs
- On the maximum order of graphs embedded in surfaces
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)
