Antineighbourhood graphs

Jerzy Topp; Lutz Volkmann

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Displaying similar documents to “Antineighbourhood graphs”

Note on $k$ -chromatic graphs

Dănuţ Marcu (1994)

Mathematica Bohemica

Similarity:

In this paper we characterize $k$ -chromatic graphs without isolated vertices and connected $k$ -chromatic graphs having a minimal number of edges.

A note on two circumference generalizations of Chvátal's Hamiltonicity condition

Ladislav Stacho (2002)

Mathematica Slovaca

Similarity:

Graphs in which each pair of vertices has exactly two common neighbours

Bohdan Zelinka (1993)

Mathematica Bohemica

Similarity:

The paper studies graphs in which each pair of vertices has exactly two common neighbours. It disproves a conjectury by P. Hliněný concerning these graphs.

Some characteristics of the edge distance between graphs

Pavel Hrnčiar, Alfonz Haviar, Gabriela Monoszová (1996)

Czechoslovak Mathematical Journal

Similarity:

Displaying similar documents to “Antineighbourhood graphs”

Note on k -chromatic graphs

A note on two circumference generalizations of Chvátal's Hamiltonicity condition

Graphs in which each pair of vertices has exactly two common neighbours

Some characteristics of the edge distance between graphs

Note on $k$ -chromatic graphs