The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “On the number of labeled k -arch graphs.”

Tree-Like Partial Hamming Graphs

Tanja Gologranc (2014)

Discussiones Mathematicae Graph Theory

Similarity:

Tree-like partial cubes were introduced in [B. Brešar, W. Imrich, S. Klavžar, Tree-like isometric subgraphs of hypercubes, Discuss. Math. Graph Theory, 23 (2003), 227-240] as a generalization of median graphs. We present some incorrectnesses from that article. In particular we point to a gap in the proof of the theorem about the dismantlability of the cube graph of a tree-like partial cube and give a new proof of that result, which holds also for a bigger class of graphs, so called tree-like...

Centers in line graphs

Martin Knor, Ľudovít Niepel, Ľubomír Šoltés (1993)

Mathematica Slovaca

Similarity:

The disjoint cliques problem

Klaus Jansen, Petra Scheffler, Gerhard Woeginger (1997)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity: