Improved Hardness for H-Colourings of G-Colourable Graphs

doi 10.1137/1.9781611975994.86
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

Universal H-Colourable Graphs

Graphs and Combinatorics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2012English

Derived Colourings of Graphs

English

Colourings in Bipartite Graphs

International Journal of Computer Applications
2011English

Forbidden Structures for Planar Perfect Consecutively Colourable Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2017English

Asymmetric Two-Colourings of Graphs in S3

Mathematical Proceedings of the Cambridge Philosophical Society
Mathematics
2002English

Conflict-Free Colourings of Graphs and Hypergraphs

Combinatorics Probability and Computing
StatisticsProbabilityApplied MathematicsMathematicsComputational TheoryTheoretical Computer Science
2009English

Acyclic Colourings of Planar Graphs With Large Girth

Journal of the London Mathematical Society
Mathematics
1999English

A Note on Perfect Lucky K-Colourable Graphs

Journal of Mathematics and Computer Science
Computational MechanicsComputational MathematicsComputer Science ApplicationsMathematics
2020English

Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size

Combinatorics Probability and Computing
StatisticsProbabilityApplied MathematicsMathematicsComputational TheoryTheoretical Computer Science
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy