Parity vertex colouring of graphs

Piotr Borowiecki; Kristína Budajová; Stanislav Jendrol'; Stanislav Krajci

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

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

Displaying similar documents to “Parity vertex colouring of graphs”

Relaxed graceful labellings of trees.

Van Bussel, Frank (2002)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

One-two descriptor of graphs

K. CH. Das, I. Gutman, D. Vukičević (2011)

Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques

Similarity:

Distance in graphs

Roger C. Entringer, Douglas E. Jackson, D. A. Snyder (1976)

Czechoslovak Mathematical Journal

Similarity:

Contraction distance between isomorphism classes of graphs

Bohdan Zelinka (1990)

Časopis pro pěstování matematiky

Similarity:

On the Vertex Separation of Maximal Outerplanar Graphs

Markov, Minko (2008)

Serdica Journal of Computing

Similarity:

We investigate the NP-complete problem Vertex Separation (VS) on Maximal Outerplanar Graphs (mops). We formulate and prove a “main theorem for mops”, a necessary and sufficient condition for the vertex separation of a mop being k. The main theorem reduces the vertex separation of mops to a special kind of stretchability, one that we call affixability, of submops.

On the Vertex Separation of Cactus Graphs

Markov, Minko (2007)

Serdica Journal of Computing

Similarity:

This paper is part of a work in progress whose goal is to construct a fast, practical algorithm for the vertex separation (VS) of cactus graphs. We prove a theorem for cacti", a necessary and sufficient condition for the VS of a cactus graph being k. Further, we investigate the ensuing ramifications that prevent the construction of an algorithm based on that theorem only.