Graph theory
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- One-matching bi-Cayley graphs over Abelian groups
- Matrix norms and rapid mixing for spin systems
- Perfect matchings and K₄^3-tilings in hypergraphs of large codegree
- Improved book-embeddings of incomplete hypercubes
- Regular Steinhaus graphs of odd degree
- Excessive near 1-factorizations
- Embeddings into almost self-centered graphs of given radius
- The signless Laplacian spectral radius of \(k\)-connected irregular graphs
- Excluding a full grid minor
- On finite rings in which nilpotent graphs satisfy the Dirac's condition
- Coverings and homotopy of a graph
- Measurable chromatic and independence numbers for ergodic graphs and group actions
- Three conjectures on the signed cycle domination in graphs
- Paths to trees and cacti
- Mining communities and their descriptions on attributed graphs: a survey
- Reducing graph transversals via edge contractions
- Upper bounds on the (signless Laplacian) spectral radius of irregular weighted graphs
- Infinite chromatic games
- Finding colorful paths in temporal graphs
- Weighted 2-sections and hypergraph reconstruction
- Structural parameterizations with modulator oblivion
- Grammars and clique-width bounds from split decompositions
- On quasi-planar graphs: clique-width and logical description
- Critical and flow-critical snarks coincide
- The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints
- The connective eccentricity index and modified second Zagreb index of Parikh word representable graphs
- Rabin's theorem in the concurrency setting: a conjecture
- Forcing finite minors in sparse infinite graphs by large-degree assumptions
- On Eulerian orientations of even-degree hypercubes
- Sum-product graphical models
- Infinitesimal unitary Hopf algebras and planar rooted forests
- 2-coloring number revisited
- Relations between total irregularity and non-self-centrality of graphs
- 2-resonant fullerenes
- Wheel-free planar graphs
- On compactness of logics that can express properties of symmetry or connectivity
- Partitioning a graph into disjoint cliques and a triangle-free graph
- Eigenvalue asymptotics for the damped wave equation on metric graphs
- Unified Hanani-Tutte theorem
- Geometric bijections between spanning trees and break divisors
- A flow theory for the dichromatic number
- Model identification of a network as compressing sensing
- Branch decomposition heuristics for linear matroids
- High-dimensional incipient infinite clusters revisited
- Symmetric determinantal representations in characteristic 2
- Parameterized and exact algorithms for class domination coloring
- Simultaneous feedback edge set: a parameterized perspective
- Minimum strictly fundamental cycle bases of planar graphs are hard to find
- Parameterized complexity of envy-free resource allocation in social networks
- Parameterized complexity of computing maximum minimal blocking and hitting sets
- Graphs with no \(\bar{P}_7\)-minor
- Handbook of graph theory
- Graph-theoretic concepts and algorithms
- Parameterized and exact algorithms for class domination coloring
- Rainbow connection number of amalgamation of some graphs
- Edge coloring: a natural model for sports scheduling
- Excluding clocks
- Recent progress on well-quasi-ordering graphs
- scientific article; zbMATH DE number 3902654 (Why is no real title available?)
- Series parallel digraphs with loops
- On the diameter of partition polytopes and vertex-disjoint cycle cover
- On doubly light triangles in plane graphs
- scientific article; zbMATH DE number 42695 (Why is no real title available?)
- scientific article; zbMATH DE number 42739 (Why is no real title available?)
- On spanning tree packings of highly edge connected graphs
- scientific article; zbMATH DE number 193227 (Why is no real title available?)
- Menger's theorem in \(\Pi^1_1 \mathrm {-CA}_0\)
- Hexagonal resonance of (3,6)-fullerenes
- scientific article; zbMATH DE number 1734461 (Why is no real title available?)
- Modeling the topology of a dynamical network via Wiener filtering approach
- scientific article; zbMATH DE number 1552063 (Why is no real title available?)
- Balanced abelian group-valued functions on directed graphs
- Adinkras from ordered quartets of \(\mathrm{BC}_{4}\) Coxeter group elements and regarding another Gadget's 1,358,954,496 matrix elements
- Polyhedral study of the connected subgraph problem
- Avoiding 7-circuits in 2-factors of cubic graphs
- scientific article; zbMATH DE number 945671 (Why is no real title available?)
- Qualitative constraint satisfaction problems: an extended framework with landmarks
- Controllability of system dynamics on networks, quantum walks and random walks
- scientific article; zbMATH DE number 1432797 (Why is no real title available?)
- The distinguishing index of connected graphs without pendant edges
- 1-Planar Graphs
- Calculizing classical inferential erotetic logic
- On Proper Labellings of Graphs with Minimum Label Sum
- Optimal In-place Algorithms for Basic Graph Problems
- Kernelization of Arc Disjoint Cycle Packing in \alpha -Bounded Digraphs
- Parameterization of tensor network contraction
- On a routing open shop problem on two nodes with unit processing times
- Log diameter rounds algorithms for 2-vertex and 2-edge connectivity
- Finding Tutte paths in linear time
- A Hopf algebra on subgraphs of a graph
- The power of the combined basic linear programming and affine relaxation for promise constraint satisfaction problems
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- Infinite graphs with finite dominating sets
- scientific article; zbMATH DE number 5255718 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- Graph Theory
- Embedded paths and cycles in faulty hypercubes
- Quadratic vertex kernel for split vertex deletion
- On the complexity of finding large odd induced subgraphs and odd colorings
- Parameterized complexity of conflict-free set cover
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)
