<--- Back to Details
First PageDocument Content
Graph theory / Mathematics / Morphisms / Graph minor / Planar graph / Graph isomorphism problem / Graph property / Graph isomorphism / Planar cover / Graph homomorphism / Line graph / Book:Graph Theory
Date: 2013-09-27 02:52:02
Graph theory
Mathematics
Morphisms
Graph minor
Planar graph
Graph isomorphism problem
Graph property
Graph isomorphism
Planar cover
Graph homomorphism
Line graph
Book:Graph Theory

CHARLES UNIVERSITY FACULTY OF MATHEMATICS AND PHYSICS   LOCALLY INJECTIVE HOMOMORPHISMS

Add to Reading List

Source URL: kam.mff.cuni.cz

Download Document from Source Website

File Size: 584,84 KB

Share Document on Facebook

Similar Documents

CHARLES UNIVERSITY FACULTY OF MATHEMATICS AND PHYSICS   LOCALLY INJECTIVE HOMOMORPHISMS

CHARLES UNIVERSITY FACULTY OF MATHEMATICS AND PHYSICS   LOCALLY INJECTIVE HOMOMORPHISMS

DocID: 1r5we - View Document

Although the result is correct, the algorithm and analysis presented in this paper contain non-trivial errors. These have been fixed in a technical report (availabe at http://www.disco.ethz.ch/publications/planarmds_-1.p

Although the result is correct, the algorithm and analysis presented in this paper contain non-trivial errors. These have been fixed in a technical report (availabe at http://www.disco.ethz.ch/publications/planarmds_-1.p

DocID: 1r43q - View Document

Algorithmica:385–414 DOIs00453Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs George B. Mertzios · Paul G. Spirakis

Algorithmica:385–414 DOIs00453Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs George B. Mertzios · Paul G. Spirakis

DocID: 1qc3P - View Document

Planar Vertex Cover [Lichtensteinvariable clause

Planar Vertex Cover [Lichtensteinvariable clause

DocID: 1lVXO - View Document

Structural parameterizations for boxicity Henning Bruhn, Morgan Chopin, Felix Joos and Oliver Schaudt Abstract The boxicity of a graph G is the least integer d such that G has an intersection model of axis-aligned d-dime

Structural parameterizations for boxicity Henning Bruhn, Morgan Chopin, Felix Joos and Oliver Schaudt Abstract The boxicity of a graph G is the least integer d such that G has an intersection model of axis-aligned d-dime

DocID: 1kGeD - View Document