Graph theory - MaRDI portal

zbMATH Open1086.05001MaRDI QIDQ3374865FDOQ3374865

Publication date: 23 February 2006

Recommendations

scientific article; zbMATH DE number 2203240
Graph-theoretic concepts and algorithms
scientific article; zbMATH DE number 1432797
scientific article
Graph theory

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)

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
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
Infinitesimal unitary Hopf algebras and planar rooted forests
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
The distinguishing index of connected graphs without pendant edges
Three conjectures on the signed cycle domination in graphs
Parameterized complexity of conflict-free set cover
Tangle bases: Revisited
Title not available (Why is that?)
Computational complexity of distance edge labeling
Mining communities and their descriptions on attributed graphs: a survey
Reducing graph transversals via edge contractions
Title not available (Why is that?)
Title not available (Why is that?)
Finding colorful paths in temporal graphs
Upper bounds on the (signless Laplacian) spectral radius of irregular weighted graphs
Coverings and homotopy of a graph
Parameterized and exact algorithms for class domination coloring
The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints
A flow theory for the dichromatic number
Structural parameterizations with modulator oblivion
Simultaneous feedback edge set: a parameterized perspective
Improved book-embeddings of incomplete hypercubes
Geometric bijections between spanning trees and break divisors
Forcing finite minors in sparse infinite graphs by large-degree assumptions
Grammars and clique-width bounds from split decompositions
On quasi-planar graphs: clique-width and logical description
The Power of the Combined Basic Linear Programming and Affine Relaxation for Promise Constraint Satisfaction Problems
Unified Hanani-Tutte theorem
Excluding a full grid minor
On the complexity of finding large odd induced subgraphs and odd colorings
Optimal In-place Algorithms for Basic Graph Problems
Title not available (Why is that?)
Sum-product graphical models
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

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)