The Two-Triangle Case of the Acquaintance Graph

DOI10.2307/2687868zbMath0235.05105OpenAlexW4234365739MaRDI QIDQ5644007

Frank Harary

Publication date: 1972

Full work available at URL: https://doi.org/10.2307/2687868

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Unnamed Item, Unnamed Item, On \(\alpha\)-split domination in graphs, A more compact visibility representation, Nonvanishing Betti numbers of edge ideals of weakly chordal graphs, Secure equitability in graphs, Analytic odd mean labeling of union and identification of some graphs, Edge ideals of oriented graphs, Cohen–Macaulay binomial edge ideals of cactus graphs, Totally unimodular nets, Universal slope sets for upward planar drawings, Unnamed Item, A self-stabilizing algorithm for detecting fundamental cycles in a graph with DFS spanning tree given, Novel classes of integers and their applications in graph labeling, Square root stress-sum index for graphs, Incomparability Graphs of Lattices, A New Characterization of Paired Domination Number of a Graph, Distinguished Minimal Topological Lassos, On even-odd meanness of super subdivision of some graphs, Integer round-up property for the chromatic number of some \(h\)-perfect graphs, Unnamed Item, Unions of orthogonally convex or orthogonally starshaped polygons, Minimal triangulations of two-dimensional manifolds, Graphoidal bipartite graphs, Unnamed Item, Unnamed Item, Unnamed Item, Total neighborhood prime labeling of some trees, Unnamed Item, Cohen-Macaulay bipartite graphs, Counting genealogical trees, On one modulo three mean labeling of graphs, Group operations and isomorphic relation with the 2-tuple linguistic variables, Reduction graph and its application on algebraic graphs, Unnamed Item, Unnamed Item, Unnamed Item, Description of interacting channel gating using a stochastic Markovian model, On the restricted arc-connectivity of \(s\)-geodetic digraphs, An annotated bibliography on 1-planarity, Extending the type reproduction number to infectious disease control targeting contacts between types, Novel concepts of bipolar fuzzy competition graphs, Group S_{3} Cordial Remainder Labeling for Path and Cycle related Graphs, Information content of molecular graph and prediction of gas phase thermal entropy of organic compounds, Odd Vertex Equitable Even Labeling of Cycle Related Graphs, One modulo three mean labeling of transformed trees, Odd vertex equitable even labeling of graphs, On claw-free \(t\)-perfect graphs, Unnamed Item, A distributed fault identification protocol for wireless and mobile ad hoc networks, A generalization of the matrix-tree theorem, Symbolic Powers of Monomial Ideals and Cohen-Macaulay Vertex-Weighted Digraphs, A self-stabilizing algorithm for finding weighted centroid in trees, Graph theoretical criteria for stability and boundedness of predator-prey systems, Unnamed Item, Odd harmonious labeling of super subdivisión graphs, 3-product cordial labeling of some snake graphs, Even vertex equitable even labeling for snake related graphs, Further results on 3-product cordial labeling, Odd harmonious labeling of grid graphs, A new family of chromatically unique 6-bridge graph, Odd Vertex equitable even labeling of cyclic snake related graphs, Extended results on sum divisor cordial labeling, Computation of Narayana Prime Cordial Labeling of Book Graphs, Skolem difference mean labeling of disconnected graphs, Algebraic and combinatorial properties of ideals and algebras of uniform clutters of TDI systems, Structural behaviour of MMD labeling on some SSP bipartite graphs, Some results on SD-Prime cordial labeling, The zero-divisor graph of an amalgamated algebra, Depth and regularity of monomial ideals via polarization and combinatorial optimization, The square of a block graph, Generating functions for mechanism specialization, On the symmetric travelling salesman problem I: Inequalities, Unnamed Item, Yang-Baxter equation in median algebras, On the complexity of Archimedean solids, Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings, Certain types of product bipolar fuzzy graphs, $k$-odd mean labeling of prism, Fast incremental planarity testing, Unnamed Item, Unnamed Item, Secure restrained domination in graphs, Recursiveness vs. interdependence in econometric models: A comprehensive analysis for the linear case, Unnamed Item, On the measurement of shape, Some results about nonlinear chemical systems represented by trees and cycles, Sets of disjoint snakes based on a Reed-Muller code and covering the hypercube, Domination integrity of some graph classes, Network companies and competitiveness: A framework for analysis, Unnamed Item, Знаковые графы эквивалентности степени тоша, INDEPENDENT DOM-SATURATION NUMBER OF A GRAPH, ON GROWTH TRIANGULAR GRAPHS, Restricted triangular difference mean graphs, \(k\)-Zumkeller labeling of super subdivision of some graphs, A geometric approach to deploying robot swarms, Paths and cycles concerning independence edges, Analyse und Synthese zuverlässiger Netze, A Characterization of the extended DII-sequence, Unnamed Item, Unnamed Item, Odd Harmonious Labeling of Some Classes of Graphs, On the Zagreb Index of Random Recursive Trees, An algorithm to Cyclic Path Covering Number, The diameter of the zero-divisor graph of an amalgamated algebra, An efficient parallel graph edge matching algorithm and its applications, Projective dimension and regularity of edge ideals of some weighted oriented graphs, Sets defining minimal vertex covers, \(\widehat S_k\)-factorization of symmetric complete tripartite digraphs, Planar drawings of fixed-mobile bigraphs, A new method to decision-making with fuzzy competition hypergraphs, Fuzzy topological structures via fuzzy graphs and their applications, On even vertex odd mean labeling of the calendula graphs, Zur Unabhängigkeit von Hilberts Axiomen des affinen Raumes, Independent domination in signed graphs, A study on the existence of null labelling for 3-hypergraphs, A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs