Graph theory
From MaRDI portal
Publication:3374865
zbMATH Open1086.05001MaRDI QIDQ3374865FDOQ3374865
Authors: Reinhard Diestel
Publication date: 23 February 2006
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Graph theory (05Cxx)
Cited In (only showing first 100 items - show all)
- Balanced Abelian group-valued functions on directed graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Minimum strictly fundamental cycle bases of planar graphs are hard to find
- Nice pairs of disjoint pentagons in fullerene graphs
- Symmetric determinantal representations in characteristic 2
- Handbook of graph theory
- Menger's theorem in \(\Pi^1_1 \mathrm {-CA}_0\)
- Parameterized complexity of multicut in weighted trees
- On the diameter of partition polytopes and vertex-disjoint cycle cover
- On spanning tree packings of highly edge connected graphs
- Title not available (Why is that?)
- Recognition of linear and star variants of leaf powers is in P
- Graphs with no \(\bar{P}_7\)-minor
- 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
- On non-normal arc-transitive 4-valent dihedrants
- Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree
- Title not available (Why is that?)
- The asynchronous bounded-cycle model
- Finding cactus roots in polynomial time
- 4-factor-criticality of vertex-transitive graphs
- 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
- On finite rings in which nilpotent graphs satisfy the Dirac's condition
- 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
- One-matching bi-Cayley graphs over Abelian groups
- Title not available (Why is that?)
- Title not available (Why is that?)
- Quantifying the extent of lateral gene transfer required to avert a `genome of Eden'
- The extreme eigenvalues and maximum degree of \(k\)-connected irregular graphs
- Rainbow connection number of amalgamation of some graphs
- Edge coloring: a natural model for sports scheduling
- Excluding clocks
- Polyhedral study of the connected subgraph problem
- Avoiding 7-circuits in 2-factors of cubic graphs
- Parameterized and Exact Algorithms for Class Domination Coloring
- Wheel-free planar graphs
- Selecting and estimating regular vine copulae and application to financial returns
- On Eulerian orientations of even-degree hypercubes
- Model identification of a network as compressing sensing
- Resource allocation with time intervals
- Regular Steinhaus graphs of odd degree
- Some properties of \(k\)-trees
- On Proper Labellings of Graphs with Minimum Label Sum
- Infinite graphs with finite dominating sets
- Matrix norms and rapid mixing for spin systems
- Controllability of system dynamics on networks, quantum walks and random walks
- Jacobians of nearly complete and threshold graphs
- Collaborative software infrastructure for adaptive multiple model simulation
- Recent Progress on Well-Quasi-ordering Graphs
- Measurable chromatic and independence numbers for ergodic graphs and group actions
- Series parallel digraphs with loops
- Adinkras from ordered quartets of BC4 Coxeter group elements and regarding another Gadget’s 1,358,954,496 matrix elements
- Excessive near 1-factorizations
- High-dimensional incipient infinite clusters revisited
- Critical and flow-critical snarks coincide
- Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian
- Embedded paths and cycles in faulty hypercubes
- Hajós' conjecture and cycle power graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reducing the vertex cover number via edge contractions
- Graph theory
- Title not available (Why is that?)
- Quadratic vertex kernel for split vertex deletion
- Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters
- How to Frame a Mathematician
- Simultaneous feedback edge set: a parameterized perspective
- The parameterized complexity of cycle packing: indifference is not an issue
- Kernelization of Arc Disjoint Cycle Packing in $$\alpha $$-Bounded Digraphs
- Parameterized complexity of envy-free resource allocation in social networks
- Parameterized complexity of computing maximum minimal blocking and hitting sets
- On the number of edges in a \(K_5\)-minor-free graph of given girth
- The complexity of bicriteria tree-depth
- 2-coloring number revisited
- A characterization of signed graphs with generalized perfect elimination orderings
- 1-Planar Graphs
- Title not available (Why is that?)
- CALCULIZING CLASSICAL INFERENTIAL EROTETIC LOGIC
- Deletion to scattered graph classes. II: Improved FPT algorithms for deletion to pairs of graph classes
- Paths to trees and cacti
- Graph Theory
- Rabin's theorem in the concurrency setting: a conjecture
- Infinite chromatic games
- A Hopf algebra on subgraphs of a graph
- Branch decomposition heuristics for linear matroids
- The connective eccentricity index and modified second Zagreb index of Parikh word representable graphs
- Graph-theoretic concepts and algorithms
- On compactness of logics that can express properties of symmetry or connectivity
- Subset feedback vertex set in chordal and split graphs
- On a routing Open Shop Problem on two nodes with unit processing times
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)