Graphs, friends and acquaintances

DOI10.5614/ejgta.2018.6.2.8zbMath1467.05153arXiv1611.07462OpenAlexW2182621829MaRDI QIDQ5009989

C. Dalfó, Miquel Àngel Fiol

Publication date: 23 August 2021

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

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

zbMATH Keywords

Boolean algebraedge-coloringRamsey theorydistance-regularitycompletely regular codeMenger's theoremHall's marriage theorem

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Computation of new diagonal graph Ramsey numbers ⋮ Variations on Ramsey numbers and minimum numbers of monochromatic triangles in line $2$-colorings of configurations ⋮ A numeral system for the middle-levels graphs

Cites Work

• Every planar map is four colorable. II: Reducibility
• Algebraic characterizations of distance-regular graphs
• From local adjacency polynomials to locally pseudo-distance-regular graphs
• The four-colour theorem
• A Link Between the Jordan Curve Theorem and the Kuratowski Planarity Criterion
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• An attempt to understand the four color problem
• Maximally connected digraphs
• The connectivity of large digraphs and graphs
• Combinatorial Relations and Chromatic Graphs
• On the algebraic theory of pseudo-distance-regularity around a set
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Graphs, friends and acquaintances