scientific article

zbMath0769.05035MaRDI QIDQ4028414

Martin Aigner, Zsolt Tuza, Eberhard Triesch

Publication date: 28 March 1993

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

zbMATH Keywords

packingsstar graphEulerian subgraphs\(k\)-regular graphsrandom coloringsedge- coloringOberwolfach problem of Ringel

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (24)

Kaleidoscopic colorings of graphs ⋮ A smallest irregular oriented graph containing a given diregular one ⋮ Vertex‐distinguishing edge colorings of random graphs ⋮ Vertex-distinguishing edge colorings of graphs ⋮ Vertex-distinguishing proper arc colorings of digraphs ⋮ The edge-distinguishing chromatic number of petal graphs, chorded cycles, and spider graphs ⋮ The irregular coloring number of a tree ⋮ Vertex-distinguishing edge-colorings of 2-regular graphs ⋮ Vertex-coloring 2-edge-weighting of graphs ⋮ A Vizing-like theorem for union vertex-distinguishing edge coloring ⋮ On the total detection numbers of complete bipartite graphs ⋮ The adjacent vertex distinguishing total chromatic number ⋮ Gap vertex-distinguishing edge colorings of graphs ⋮ Balanced edge colorings. ⋮ Vertex-distinguishing proper edge colourings of some regular graphs ⋮ Extremal problems on detectable colorings of trees ⋮ Degree constrained subgraphs ⋮ Vertex colouring edge partitions ⋮ Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree ⋮ The algorithm for adjacent vertex distinguishing proper edge coloring of graphs ⋮ How to make a random graph irregular ⋮ Decompositions of pseudographs into closed trails of even sizes ⋮ On the vertex-distinguishing proper edge-colorings of graphs ⋮ A note on the total detection numbers of cycles

This page was built for publication: