Graph theory
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- On Eulerian orientations of even-degree hypercubes
- Geometric bijections between spanning trees and break divisors
- Resource allocation with time intervals
- Forcing finite minors in sparse infinite graphs by large-degree assumptions
- Model identification of a network as compressing sensing
- The parameterized complexity of cycle packing: indifference is not an issue
- Grammars and clique-width bounds from split decompositions
- On quasi-planar graphs: clique-width and logical description
- Regular Steinhaus graphs of odd degree
- Kernelization of Arc Disjoint Cycle Packing in \alpha -Bounded Digraphs
- Some properties of \(k\)-trees
- Matrix norms and rapid mixing for spin systems
- On Proper Labellings of Graphs with Minimum Label Sum
- Controllability of system dynamics on networks, quantum walks and random walks
- Infinite graphs with finite dominating sets
- On a routing open shop problem on two nodes with unit processing times
- Jacobians of nearly complete and threshold graphs
- Collaborative software infrastructure for adaptive multiple model simulation
- Parameterized complexity of envy-free resource allocation in social networks
- Excluding a full grid minor
- Unified Hanani-Tutte theorem
- On the complexity of finding large odd induced subgraphs and odd colorings
- Parameterized complexity of computing maximum minimal blocking and hitting sets
- Measurable chromatic and independence numbers for ergodic graphs and group actions
- Series parallel digraphs with loops
- Optimal In-place Algorithms for Basic Graph Problems
- scientific article; zbMATH DE number 7561507 (Why is no real title available?)
- Sum-product graphical models
- Excessive near 1-factorizations
- High-dimensional incipient infinite clusters revisited
- On the number of edges in a \(K_5\)-minor-free graph of given girth
- Critical and flow-critical snarks coincide
- Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian
- Hajós' conjecture and cycle power graphs
- Embedded paths and cycles in faulty hypercubes
- The complexity of bicriteria tree-depth
- l₁-embeddability under the edge-gluing operation on some nonbipartite graphs
- Minimum strictly fundamental cycle bases of planar graphs are hard to find
- A characterization of signed graphs with generalized perfect elimination orderings
- 2-coloring number revisited
- Nice pairs of disjoint pentagons in fullerene graphs
- scientific article; zbMATH DE number 1432797 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- Symmetric determinantal representations in characteristic 2
- Handbook of graph theory
- 1-Planar Graphs
- Menger's theorem in \(\Pi^1_1 \mathrm {-CA}_0\)
- Paths to trees and cacti
- The power of the combined basic linear programming and affine relaxation for promise constraint satisfaction problems
- Deletion to scattered graph classes. II: Improved FPT algorithms for deletion to pairs of graph classes
- On the diameter of partition polytopes and vertex-disjoint cycle cover
- On spanning tree packings of highly edge connected graphs
- Graph Theory
- scientific article; zbMATH DE number 193227 (Why is no real title available?)
- K₅-subdivisions in graphs containing K₄^-
- Parameterized complexity of multicut in weighted trees
- scientific article; zbMATH DE number 1552063 (Why is no real title available?)
- scientific article; zbMATH DE number 42695 (Why is no real title available?)
- Graphs with no \(\bar{P}_7\)-minor
- Rabin's theorem in the concurrency setting: a conjecture
- Recognition of linear and star variants of leaf powers is in P
- Embeddings into almost self-centered graphs of given radius
- Hexagonal resonance of (3,6)-fullerenes
- Quantitative noise sensitivity and exceptional times for percolation
- Linked tree-decompositions of represented infinite matroids
- Qualitative constraint satisfaction problems: an extended framework with landmarks
- Infinite chromatic games
- On non-normal arc-transitive 4-valent dihedrants
- Branch decomposition heuristics for linear matroids
- Reducing the vertex cover number via edge contractions
- A Hopf algebra on subgraphs of a graph
- The connective eccentricity index and modified second Zagreb index of Parikh word representable graphs
- Perfect matchings and K₄^3-tilings in hypergraphs of large codegree
- On compactness of logics that can express properties of symmetry or connectivity
- Graph-theoretic concepts and algorithms
- The asynchronous bounded-cycle model
- Finding cactus roots in polynomial time
- 4-factor-criticality of vertex-transitive graphs
- scientific article; zbMATH DE number 3902654 (Why is no real title available?)
- Graph theory
- Adinkras from ordered quartets of \(\mathrm{BC}_{4}\) Coxeter group elements and regarding another Gadget's 1,358,954,496 matrix elements
- On doubly light triangles in plane graphs
- Partitioning a graph into disjoint cliques and a triangle-free graph
- Modeling the topology of a dynamical network via Wiener filtering approach
- Infinitesimal unitary Hopf algebras and planar rooted forests
- On finite rings in which nilpotent graphs satisfy the Dirac's condition
- Eigenvalue asymptotics for the damped wave equation on metric graphs
- The signless Laplacian spectral radius of \(k\)-connected irregular graphs
- Weighted 2-sections and hypergraph reconstruction
- Three conjectures on the signed cycle domination in graphs
- scientific article; zbMATH DE number 5255718 (Why is no real title available?)
- The distinguishing index of connected graphs without pendant edges
- Relations between total irregularity and non-self-centrality of graphs
- 2-resonant fullerenes
- Independent paths and \(K_{5}\)-subdivisions
- Unavoidable topological minors of infinite graphs
- Parameterized complexity of conflict-free set cover
- scientific article; zbMATH DE number 1734461 (Why is no real title available?)
- Tangle bases: Revisited
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)
