scientific article; zbMATH DE number 5202336

Publication date: 22 October 2007

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

planar graphs regularity lemma Ramsey theory matchings probabilistic method cliques stable sets four-colour problem electrical networks edge colourings vertex colourings map colourings hamilton cycles basic graph theory: trees coverings and packings in directed graphs cycles: nonseparable graphs: tree-search algorithms flows in networks: complexity of algorithms: connectivity integer flows and coverings

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Graph theory (05Cxx)

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

Degree sum conditions for cyclability in bipartite graphs ⋮ Approximate min-max relations on plane graphs ⋮ Rainbow connection in 3-connected graphs ⋮ Nordhaus-Gaddum-type theorem for rainbow connection number of graphs ⋮ Neighborhood unions for the existence of disjoint chorded cycles in graphs ⋮ A study of monopolies in graphs ⋮ Metrization of weighted graphs ⋮ Black-box Trace\&Revoke codes ⋮ Towards an optimization theory for deforming dense granular materials: minimum cost maximum flow solutions ⋮ The rainbow connection number of 2-connected graphs ⋮ Computational complexity of a solution for directed graph cooperative games ⋮ Further hardness results on the rainbow vertex-connection number of graphs ⋮ Fixed points for \(G\)-contractions on uniform spaces endowed with a graph ⋮ Max-min weight balanced connected partition ⋮ Fault-free Hamiltonian cycles passing through a linear forest in ternary \(n\)-cubes with faulty edges ⋮ Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes ⋮ On a magnetic characterization of spectral minimal partitions ⋮ On the determinant of bipartite graphs ⋮ Realizing degree sequences with \(k\)-edge-connected uniform hypergraphs ⋮ Spectra of digraph transformations ⋮ Covering digraphs with small indegrees or outdegrees by directed cuts ⋮ Improved bound on facial parity edge coloring ⋮ The complexity of multicut and mixed multicut problems in (di)graphs ⋮ Strong matching preclusion for torus networks ⋮ Total coloring of planar graphs with 7-cycles containing at most two chords ⋮ Paired many-to-many disjoint path covers in faulty hypercubes ⋮ On \(r\)-hued coloring of \(K_4\)-minor free graphs ⋮ The Erdős-Sós conjecture for spiders of large size ⋮ On the existence and number of (\(k+1\))-kings in \(k\)-quasi-transitive digraphs ⋮ Equitable vertex arboricity of graphs ⋮ Non-monochromatic non-rainbow colourings of \(\sigma\)-hypergraphs ⋮ Graphs with equal chromatic symmetric functions ⋮ On 1-Hamilton-connected claw-free graphs ⋮ Total chromatic number of generalized Mycielski graphs ⋮ Cutwidth of triangular grids ⋮ Induced hourglass and the equivalence between Hamiltonicity and supereulerianity in claw-free graphs ⋮ Independent sets in \(\{\text{claw}, K_4 \}\)-free 4-regular graphs ⋮ Tight upper bound of the rainbow vertex-connection number for 2-connected graphs ⋮ \(L(p,q)\)-labeling of a graph embeddable on the torus ⋮ On strongly \(\mathbb{Z}_{2s + 1}\)-connected graphs ⋮ An improved upper bound for the neighbor sum distinguishing index of graphs ⋮ An approach to conditional diagnosability analysis under the PMC model and its application to torus networks ⋮ Vertex-disjoint directed and undirected cycles in general digraphs ⋮ Regular factors and eigenvalues of regular graphs ⋮ On the Kirchhoff and the Wiener indices of graphs and block decomposition ⋮ Minimal crystallizations of 3-manifolds ⋮ Totally symmetric functions are reconstructible from identification minors ⋮ Matching covered graphs with three removable classes ⋮ Tricyclic graphs with maximal revised Szeged index ⋮ \((\Delta + 1)\)-total-colorability of plane graphs with maximum degree \(\Delta\) at least 6 and without adjacent short cycles ⋮ Rainbow connection of graphs with diameter 2 ⋮ On acyclic edge coloring of planar graphs without intersecting triangles ⋮ A sufficient condition for the existence of an anti-directed 2-factor in a directed graph ⋮ Parity vertex coloring of outerplane graphs ⋮ On generalized competition index of a primitive tournament ⋮ On super 2-restricted and 3-restricted edge-connected vertex transitive graphs ⋮ A note on Barnette's conjecture ⋮ Two counterexamples on completely independent spanning trees ⋮ Upper bounds on minimum balanced bipartitions ⋮ On dynamic monopolies of graphs with general thresholds ⋮ Injective choosability of planar graphs of girth five and six ⋮ On the number of congruence classes of paths ⋮ The weak 3-flow conjecture and the weak circular flow conjecture ⋮ Splittings of independence complexes and the powers of cycles ⋮ Packing chromatic number of distance graphs ⋮ Edge fault tolerance of graphs with respect to super edge connectivity ⋮ Low-distortion embeddings of graphs with large girth ⋮ On the spectral radius of tricyclic graphs with a maximum matching ⋮ A characterization of graphs with rank 5 ⋮ Graph of BCI-algebras ⋮ Minimal energies of trees with given parameters ⋮ On maximum Estrada indices of graphs with given parameters ⋮ On the signless Laplacian index of cacti with a given number of pendant vertices ⋮ Skew-adjacency matrices of graphs ⋮ Covering the edges of digraphs in \(\mathcal D(3,3)\) and \(\mathcal D(4,4)\) with directed cuts ⋮ Degree condition and \(Z_3\)-connectivity ⋮ Biased orientation games ⋮ \(b\)-colouring outerplanar graphs with large girth ⋮ Locally identifying colourings for graphs with given maximum degree ⋮ On the complexity of the herding attack and some related attacks on hash functions ⋮ Proximity thresholds for matching extension in the torus and Klein bottle ⋮ On dynamic coloring for planar graphs and graphs of higher genus ⋮ On the reciprocal degree distance of graphs ⋮ The asymptotic behavior of some indices of iterated line graphs of regular graphs ⋮ A note on entire choosability of plane graphs ⋮ A note on planar graphs with large width parameters and small grid-minors ⋮ On the connectivity of \(p\)-diamond-free vertex transitive graphs ⋮ On plane graphs with link component number equal to the nullity ⋮ Geodesic pancyclicity of twisted cubes ⋮ Generalized Cayley graphs associated to commutative rings ⋮ Embedding long cycles in faulty \(k\)-ary \(2\)-cubes ⋮ A discrete Gauss-Bonnet type theorem ⋮ The Hosoya indices and Merrifield-Simmons indices of graphs with connectivity at most \(K^{\bigstar}\) ⋮ A new neighborhood condition for graphs to be fractional \((k,m)\)-deleted graphs ⋮ Remoteness of permutation codes ⋮ Immersing complete digraphs ⋮ Distance spectral radius of digraphs with given connectivity ⋮ Long cycles in unbalanced bipartite graphs ⋮ On 3-connected Hamiltonian line graphs ⋮ A note on the total coloring of planar graphs without adjacent 4-cycles

This page was built for publication: