Amanote Research

Amanote Research

    RegisterSign In

Connectedness of the Graph of Vertex-Colourings

Discrete Mathematics - Netherlands
doi 10.1016/j.disc.2007.07.028
Full Text
Open PDF
Abstract

Available in full text

Categories
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
Date

March 1, 2008

Authors
Luis CerecedaJan van den HeuvelMatthew Johnson
Publisher

Elsevier BV


Related search

Facial Nonrepetitive Graph Colourings

English

Finding Vertex-Surjective Graph Homomorphisms

Acta Informatica
Computer NetworksSoftwareInformation SystemsCommunications
2012English

Vertex-Uncertainty in Graph-Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

The Upper Connected Vertex Detour Number of a Graph

Filomat
Mathematics
2012English

On Upper Bound of Vertex Distinguishing Word Length on Vertex Labeled Graph

Izvestiya of Saratov University. New Series. Series: Mathematics. Mechanics. Informatics
2013English

The Forcing Edge-To-Vertex Geodetic Number of a Graph

International Journal of Pure and Applied Mathematics
MathematicsApplied Mathematics
2015English

A Shortest Cycle for Each Vertex of a Graph

Information Processing Letters
Signal ProcessingComputer Science ApplicationsInformation SystemsTheoretical Computer Science
2011English

Limit Distributions of Vertex Degrees in a Conditional Configuration Graph

Proceedings of the Karelian Research Centre of the Russian Academy of Sciences
2018English

Derived Colourings of Graphs

English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy