Flip colouring of graphs

DOI10.1007/S00373-024-02838-WMaRDI QIDQ6632145

Josef Lauri, Christina Zarb, Xandru Mifsud, Yair Caro, Raphael Yuster

Publication date: 4 November 2024

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

Cayley graphs\((r, c)\)-constant graphslocal vs global properties

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Global majority consensus by local majority polling on graphs of a given degree sequence
• Regular graphs of large girth and arbitrary degree
• Edge disjoint placement of graphs
• Do local majorities force a global majority?
• Which trees are link graphs?
• The sum of the squares of the parts of a partition, and some related questions
• The effect of local majority on global majorityin connected graphs
• Explicit construction of graphs with an arbitrary large girth and of large size
• Local and global majorities revisited
• The feasibility problem for line graphs
• Dynamic cage survey
• Graph Theory and Probability
• Graphs with constant link and small degree or order
• The History of Degenerate (Bipartite) Extremal Graph Problems
• On the theory of graphs
• The power of small coalitions under two-tier majority on regular graphs

This page was built for publication: Flip colouring of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6632145)