scientific article

Publication date: 23 February 2006

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Graph theory (including graph drawing) in computer science (68R10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Graph theory (05Cxx)

Related Items (only showing first 100 items - show all)

Eigenvalue asymptotics for the damped wave equation on metric graphs ⋮ Minimum strictly fundamental cycle bases of planar graphs are hard to find ⋮ Graphs with no $\bar{P}_7$-minor ⋮ 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 ⋮ Nice pairs of disjoint pentagons in fullerene graphs ⋮ Embeddings into almost self-centered graphs of given radius ⋮ Weighted 2-sections and hypergraph reconstruction ⋮ The signless Laplacian spectral radius of $k$-connected irregular graphs ⋮ Symmetric determinantal representations in characteristic 2 ⋮ Rainbow connection number of amalgamation of some graphs ⋮ Edge coloring: a natural model for sports scheduling ⋮ Excluding clocks ⋮ Computational complexity of distance edge labeling ⋮ Structural parameterizations with modulator oblivion ⋮ Unified Hanani-Tutte theorem ⋮ Geometric bijections between spanning trees and break divisors ⋮ Parameterized and exact algorithms for class domination coloring ⋮ Simultaneous feedback edge set: a parameterized perspective ⋮ A flow theory for the dichromatic number ⋮ Series parallel digraphs with loops ⋮ Independent paths and $K_{5}$-subdivisions ⋮ Grammars and clique-width bounds from split decompositions ⋮ On quasi-planar graphs: clique-width and logical description ⋮ On the diameter of partition polytopes and vertex-disjoint cycle cover ⋮ On non-normal arc-transitive 4-valent dihedrants ⋮ On a routing Open Shop Problem on two nodes with unit processing times ⋮ Resource allocation with time intervals ⋮ Unavoidable topological minors of infinite graphs ⋮ On doubly light triangles in plane graphs ⋮ Quantifying the extent of lateral gene transfer required to avert a `genome of Eden' ⋮ On spanning tree packings of highly edge connected graphs ⋮ Excluding a full grid minor ⋮ Parameterized complexity of envy-free resource allocation in social networks ⋮ Menger's theorem in $\Pi^1_1 \mathrm {-CA}_0$ ⋮ Parameterized complexity of computing maximum minimal blocking and hitting sets ⋮ Measurable chromatic and independence numbers for ergodic graphs and group actions ⋮ Hexagonal resonance of (3,6)-fullerenes ⋮ Balanced Abelian group-valued functions on directed graphs ⋮ Model identification of a network as compressing sensing ⋮ Parameterized and Exact Algorithms for Class Domination Coloring ⋮ Modeling the topology of a dynamical network via Wiener filtering approach ⋮ Three conjectures on the signed cycle domination in graphs ⋮ Jacobians of nearly complete and threshold graphs ⋮ Collaborative software infrastructure for adaptive multiple model simulation ⋮ Branch decomposition heuristics for linear matroids ⋮ A Hopf algebra on subgraphs of a graph ⋮ Polyhedral study of the connected subgraph problem ⋮ Avoiding 7-circuits in 2-factors of cubic graphs ⋮ Recent Progress on Well-Quasi-ordering Graphs ⋮ Critical and flow-critical snarks coincide ⋮ Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian ⋮ Qualitative constraint satisfaction problems: an extended framework with landmarks ⋮ Controllability of system dynamics on networks, quantum walks and random walks ⋮ Adinkras from ordered quartets of BC₄ Coxeter group elements and regarding another Gadget’s 1,358,954,496 matrix elements ⋮ 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 ⋮ On finite rings in which nilpotent graphs satisfy the Dirac's condition ⋮ Coverings and homotopy of a graph ⋮ Paths to trees and cacti ⋮ Rabin's theorem in the concurrency setting: a conjecture ⋮ A characterization of signed graphs with generalized perfect elimination orderings ⋮ Hajós' conjecture and cycle power graphs ⋮ Selecting and estimating regular vine copulae and application to financial returns ⋮ Forcing finite minors in sparse infinite graphs by large-degree assumptions ⋮ Quantitative noise sensitivity and exceptional times for percolation ⋮ Some properties of $k$-trees ⋮ Linked tree-decompositions of represented infinite matroids ⋮ Unnamed Item ⋮ The asynchronous bounded-cycle model ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Finding cactus roots in polynomial time ⋮ 4-factor-criticality of vertex-transitive graphs ⋮ High-dimensional incipient infinite clusters revisited ⋮ Mining communities and their descriptions on attributed graphs: a survey ⋮ Reducing graph transversals via edge contractions ⋮ One-matching bi-Cayley graphs over Abelian groups ⋮ On Eulerian orientations of even-degree hypercubes ⋮ Upper bounds on the (signless Laplacian) spectral radius of irregular weighted graphs ⋮ Matrix norms and rapid mixing for spin systems ⋮ The extreme eigenvalues and maximum degree of $k$-connected irregular graphs ⋮ Perfect matchings and $K_4^3$-tilings in hypergraphs of large codegree ⋮ Sum-product graphical models ⋮ Infinitesimal unitary Hopf algebras and planar rooted forests ⋮ Infinite chromatic games ⋮ Improved book-embeddings of incomplete hypercubes ⋮ The distinguishing index of connected graphs without pendant edges ⋮ Regular Steinhaus graphs of odd degree ⋮ Excessive near 1-factorizations ⋮ 1-Planar Graphs ⋮ Finding colorful paths in temporal graphs ⋮ 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 ⋮ CALCULIZING CLASSICAL INFERENTIAL EROTETIC LOGIC

This page was built for publication: