Finding Vertex-Surjective Graph Homomorphisms

Acta Informatica - Germany
doi 10.1007/s00236-012-0164-0
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Graph Homomorphisms via Vector Colorings

European Journal of Combinatorics
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTheoretical Computer ScienceTopology
2019English

Exact Algorithms for Graph Homomorphisms

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
2007English

Vertex-Uncertainty in Graph-Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

Locally Constrained Graph Homomorphisms and Equitable Partitions

European Journal of Combinatorics
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTheoretical Computer ScienceTopology
2008English

Connectedness of the Graph of Vertex-Colourings

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2008English

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

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

Counting and Finding Homomorphisms Is Universal for Parameterized Complexity Theory

2020English

A Shortest Cycle for Each Vertex of a Graph

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

The Upper Connected Vertex Detour Number of a Graph

Filomat
Mathematics
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy