Graph theory
From MaRDI portal
Publication:3374865
zbMATH Open1086.05001MaRDI QIDQ3374865FDOQ3374865
Recommendations
Cited in
(only showing first 100 items - show all)- Graph-theoretic concepts and algorithms
- Sum-product graphical models
- Tangle bases: Revisited
- Graph Theory
- On compactness of logics that can express properties of symmetry or connectivity
- Weighted 2-sections and hypergraph reconstruction
- Branch decomposition heuristics for linear matroids
- Structural parameterizations with modulator oblivion
- On a routing open shop problem on two nodes with unit processing times
- Structural parameterizations with modulator oblivion
- Simultaneous feedback edge set: a parameterized perspective
- The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints
- scientific article; zbMATH DE number 1734461 (Why is no real title available?)
- Mining communities and their descriptions on attributed graphs: a survey
- Reducing graph transversals via edge contractions
- A flow theory for the dichromatic number
- Unified Hanani-Tutte theorem
- Geometric bijections between spanning trees and break divisors
- Excluding a full grid minor
- Improved book-embeddings of incomplete hypercubes
- The distinguishing index of connected graphs without pendant edges
- Calculizing classical inferential erotetic logic
- Rabin's theorem in the concurrency setting: a conjecture
- Three conjectures on the signed cycle domination in graphs
- Coverings and homotopy of a graph
- 1-Planar Graphs
- Forcing finite minors in sparse infinite graphs by large-degree assumptions
- scientific article; zbMATH DE number 7561516 (Why is no real title available?)
- Infinitesimal unitary Hopf algebras and planar rooted forests
- The power of the combined basic linear programming and affine relaxation for promise constraint satisfaction problems
- Parameterized and exact algorithms for class domination coloring
- Parameterized complexity of conflict-free set cover
- 2-coloring number revisited
- Infinite chromatic games
- Optimal In-place Algorithms for Basic Graph Problems
- Parameterized complexity of envy-free resource allocation in social networks
- Grammars and clique-width bounds from split decompositions
- On quasi-planar graphs: clique-width and logical description
- scientific article; zbMATH DE number 7559371 (Why is no real title available?)
- Finding colorful paths in temporal graphs
- On the complexity of finding large odd induced subgraphs and odd colorings
- Eigenvalue asymptotics for the damped wave equation on metric graphs
- The connective eccentricity index and modified second Zagreb index of Parikh word representable graphs
- scientific article; zbMATH DE number 7561507 (Why is no real title available?)
- Deletion to scattered graph classes. II: Improved FPT algorithms for deletion to pairs of graph classes
- The signless Laplacian spectral radius of \(k\)-connected irregular graphs
- A characterization of signed graphs with generalized perfect elimination orderings
- A Hopf algebra on subgraphs of a graph
- Upper bounds on the (signless Laplacian) spectral radius of irregular weighted graphs
- Paths to trees and cacti
- Infinite graphs with finite dominating sets
- Jacobians of nearly complete and threshold graphs
- Collaborative software infrastructure for adaptive multiple model simulation
- Polyhedral study of the connected subgraph problem
- Avoiding 7-circuits in 2-factors of cubic graphs
- On spanning tree packings of highly edge connected graphs
- Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree
- Embeddings into almost self-centered graphs of given radius
- Embedded paths and cycles in faulty hypercubes
- Parameterized and exact algorithms for class domination coloring
- scientific article; zbMATH DE number 3902654 (Why is no real title available?)
- Nice pairs of disjoint pentagons in fullerene graphs
- Graphs with no \(\bar{P}_7\)-minor
- On Eulerian orientations of even-degree hypercubes
- Symmetric determinantal representations in characteristic 2
- Hexagonal resonance of (3,6)-fullerenes
- Menger's theorem in \(\Pi^1_1 \mathrm {-CA}_0\)
- Quantifying the extent of lateral gene transfer required to avert a `genome of Eden'
- Quantitative noise sensitivity and exceptional times for percolation
- Adinkras from ordered quartets of \(\mathrm{BC}_{4}\) Coxeter group elements and regarding another Gadget's 1,358,954,496 matrix elements
- Wheel-free planar graphs
- Some properties of \(k\)-trees
- Model identification of a network as compressing sensing
- Modeling the topology of a dynamical network via Wiener filtering approach
- The extreme eigenvalues and maximum degree of \(k\)-connected irregular graphs
- scientific article; zbMATH DE number 1432797 (Why is no real title available?)
- Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian
- On non-normal arc-transitive 4-valent dihedrants
- Measurable chromatic and independence numbers for ergodic graphs and group actions
- Series parallel digraphs with loops
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- Selecting and estimating regular vine copulae and application to financial returns
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- Independent paths and \(K_{5}\)-subdivisions
- On doubly light triangles in plane graphs
- Unavoidable topological minors of infinite graphs
- Matrix norms and rapid mixing for spin systems
- Recent progress on well-quasi-ordering graphs
- Handbook of graph theory
- scientific article; zbMATH DE number 42695 (Why is no real title available?)
- The asynchronous bounded-cycle model
- Partitioning a graph into disjoint cliques and a triangle-free graph
- Linked tree-decompositions of represented infinite matroids
- On finite rings in which nilpotent graphs satisfy the Dirac's condition
- Finding cactus roots in polynomial time
- 4-factor-criticality of vertex-transitive graphs
- Parameterized complexity of multicut in weighted trees
- One-matching bi-Cayley graphs over Abelian groups
- Controllability of system dynamics on networks, quantum walks and random walks
- Rainbow connection number of amalgamation of some 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 Q3374865)
