Equipartite colorings in graphs and hypergraphs

DOI10.1016/0095-8956(77)90002-8zbMath0353.05035OpenAlexW2083958606MaRDI QIDQ1236124

F. Sterboul, Claude Berge

Publication date: 1977

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(77)90002-8

Mathematics Subject Classification ID

Relations of low-dimensional topology with graph theory (57M15) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Related Items

Equitable clique-coloring in claw-free graphs with maximum degree at most 4, Combinatorial games on a graph, Equitable coloring of hypergraphs, Extremal problems in hypergraph colourings, Equitable and proportional coloring of trees, Hypermap rewriting: A combinatorial approach, An extremal problem in hypergraph coloring, Optimisation and hypergraph theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Un problème extremal pour les graphes et les hypergraphes
• 1-Faktoren von Graphen. (1-factors of graphs)
• On maximal paths and circuits of graphs
• Intersection Theorems for Systems of Sets
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On A Combinatorial Problem III
• On a combinatorial problem. II
• The Factorization of Linear Graphs