Friendship two-graphs

DOI10.1007/s00373-010-0914-0zbMath1228.05148OpenAlexW2043628724WikidataQ59560555 ScholiaQ59560555MaRDI QIDQ604993

Endre Boros, Igor Edm. Zverovich, Vladimir A. Gurvich

Publication date: 12 November 2010

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

Full work available at URL: https://doi.org/10.1007/s00373-010-0914-0

zbMATH Keywords

matrix equationfriendship graphsfriendship two-graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Cites Work

• Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
• Vertex- and edge-minimal and locally minimal graphs
• Combinatorial designs related to the strong perfect graph conjecture
• Unnamed Item
• Unnamed Item

This page was built for publication: Friendship two-graphs