Publication:3158579
From MaRDI portal
zbMath1057.05001MaRDI QIDQ3158579
Publication date: 27 January 2005
05-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics
05Cxx: Graph theory
Related Items
Forbidden Subgraphs Generating Almost the Same Sets, Covering Graphs with Few Complete Bipartite Subgraphs, Ascending subgraph decompositions of tournaments of orders \(6n+2\) and \(6n+1\), Isolate domination in graphs, Efficient domination through eigenvalues, Vertex in-magic arc labelings of digraphs, A note on distance magic and distance antimagic graphs, On \(S\)-magic graphs, A new measure for gracefulness of graphs, The independent transversal dombondage number of a graph, Upper secure domination number of a graph, Ascending subgraph decompositions in oriented complete balanced tripartite graphs, Forbidden subgraphs generating a finite set, A note on powers of Hamilton cycles in generalized claw-free graphs, Graph access structures with optimal pixel expansion three, The Menger number of the strong product of graphs, Precise location of vertices on Hamiltonian cycles, Independent protection in graphs, Global security in claw-free cubic graphs, On domination number of Cartesian product of directed paths, The fractional metric dimension of graphs, \(k\)-rainbow domatic numbers, Vertex covers and eternal dominating sets, Star-factors with large components, On the bipartite vertex frustration of graphs, On the \(\lambda ^{\prime}\)-optimality in graphs with odd girth \(g\) and even girth \(h\), Broadcasts and domination in trees, Gallai-Ramsey numbers for cycles, A sufficient degree condition for a graph to contain all trees of size \(k\), An intermediate value theorem for the arboricities, Fastest expected time to mixing for a Markov chain on a directed graph, Rainbow generalizations of Ramsey theory: A survey, Small alliances in a weighted graph, Superconnectivity of graphs with odd girth \(g\) and even girth \(h\), Properly colored paths and cycles, Highly irregular digraphs, A branching greedoid for multiply-rooted graphs and digraphs, Various bounds for liar's domination number, Infinite families of directed strongly regular graphs using equitable partitions, Weak saturation numbers for multiple copies, On compact symmetric regularizations of graphs, Note on locating pairs of vertices on Hamiltonian cycles, The possible cardinalities of global secure sets in cographs, Domination and total domination in complementary prisms, Connectivity of graphs with given girth pair, Spanning trees homeomorphic to a small tree, Global Roman domination in graphs, On domination number of Cartesian product of directed cycles, Restrained bondage in graphs, Graphic sequences with a realization containing a complete multipartite subgraph, Matrix norms and rapid mixing for spin systems, Covering graphs with few complete bipartite subgraphs, Minimum degree and pan-\(k\)-linked graphs, Radial trees, deBruijn-like sequences and the irregular chromatic number of paths and cycles, Partitioning graphs into complete and empty graphs, On the edge-integrity of some graphs and their complements, Hamiltonian decompositions of Cayley graphs on Abelian groups, Opinion functions on trees, Star-factorization of symmetric complete bipartite digraphs, Counting stable sets on Cartesian products of graphs, Domination number of Cartesian products of directed cycles, A generalization of 0-sum flows in graphs, Some defective parameters in graphs, New bounds for the broadcast domination number of a graph, Duality for the Ising model on a random lattice and topologic excitons, Induced graphoidal decompositions in product graphs, Induced label graphoidal graphs, Sensitivity analysis of perfect state transfer in quantum spin networks, Packing parameters in graphs, Graphs with equal eternal vertex cover and eternal domination numbers, A characterization of \(P_5\)-free graphs with a homeomorphically irreducible spanning tree, Geometric biplane graphs. I: Maximal graphs, General bounds on rainbow domination numbers, On independent doubly chorded cycles, Saturation numbers for nearly complete graphs, Equality of domination and transversal numbers in hypergraphs, On average connectivity of the strong product of graphs, On the uniqueness of \(D\)-vertex magic constant, Degree conditions on claws and modified claws for Hamiltonicity of graphs, Degree sequences of monocore graphs, Perfect matchings avoiding prescribed edges in a star-free graph, Counting labeled claw-free cubic graphs by connectivity, Rainbow domination numbers on graphs with given radius, Precoloring extension involving pairs of vertices of small distance, Ascending subgraph decompositions of tournaments of order \(6n+3\), The positive Q-matrix completion problem, Majority reinforcement number, Changing and unchanging Open Packing: Edge removal, Random walk centrality and a partition of Kemeny’s constant, Optimality in Social Choice, Extensions of Gallai-Ramsey results, Signed 2-independence of Cartesian product of directed paths, Power domination in cylinders, tori, and generalized Petersen graphs
