Multiply balanced edge colorings of multigraphs

DOI10.1002/jgt.20617zbMath1244.05085arXiv1710.03836OpenAlexW1626454578MaRDI QIDQ2897208

C. A. Rodger, M. Amin Bahmanian

Publication date: 10 July 2012

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1710.03836

zbMATH Keywords

edge-coloringHamiltonian cyclesdetachmentHamiltonian decompositionamalgamations

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)

Related Items (15)

Factorizations of complete multipartite hypergraphs ⋮ Fair 1-factorizations and fair holey 1-factorizations of complete multipartite graphs ⋮ Maximal sets of Hamilton cycles in complete multipartite graphs. IV ⋮ Embedding an edge-colored \(K(a^{(p)};\lambda,\mu)\) into a Hamiltonian decomposition of \(K(a^{(p+r)};\lambda,\mu)\) ⋮ Internally fair factorizations and internally fair holey factorizations with prescribed regularity ⋮ Ryser's theorem for \(\rho\)-Latin rectangles ⋮ Constructing day-balanced round-robin tournaments with partitions ⋮ Connected Baranyai's theorem ⋮ Fair and internally fair (holey) Hamiltonian decompositions of \(K(n_0, \ldots, n_{p - 1}; \lambda_1, \lambda_2)\) ⋮ More extreme equitable colorings of decompositions of \(K_v\) and \(K_v - F\) ⋮ Amalgamations and Equitable Block-Colorings ⋮ On evenly-equitable, balanced edge-colorings and related notions ⋮ Unnamed Item ⋮ Maximal sets of Hamilton cycles in \(K \left( n^r ; \lambda_1 , \lambda_2\right)\) ⋮ Fair holey Hamiltonian decompositions of complete multipartite graphs and long cycle frames

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hamiltonian decompositions of complete graphs
• Amalgamations of factorizations of complete graphs
• Hamiltonian decompositions of complete regular s-partite graphs
• Amalgamations of almost regular edge-colourings of simple graphs
• Canonical edge-colourings of locally finite graphs
• On decomposition of r-partite graphs into edge-disjoint Hamilton circuits
• Group divisible designs with two associate classes: \(n=2\) or \(m=2\)
• Amalgamations of connected \(k\)-factorizations.
• Non-separable detachments of graphs
• Hamilton decompositions of complete graphs with a 3-factor leave.
• Hamilton cycle rich 2-factorizations of complete multipartite graphs
• 4-Cycle Group-Divisible Designs with Two Associate Classes
• Nondisconnecting disentanglements of amalgamated 2-factorizations of complete multipartite graphs
• Connected Detachments of Graphs and Generalized Euler Trails
• On A Particular Conference Scheduling Problem
• Embedding edge‐colorings into 2‐edge‐connected k‐factorizations of k_kn+1
• Hamilton decompositions of complete multipartite graphs with any 2‐factor leave
• Hamilton cycle rich two-factorizations of complete graphs
• Highly edge-connected detachments of graphs and digraphs
• The Solution of a Timetabling Problem
• Classification and Analysis of Partially Balanced Incomplete Block Designs with Two Associate Classes

This page was built for publication: Multiply balanced edge colorings of multigraphs