Narrowing the Complexity Gap for Colouring (Cs, Pt)-Free Graphs

Computer Journal - United Kingdom
doi 10.1093/comjnl/bxv039
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Oxford University Press (OUP)

Related search

Colouring Squares of Claw-Free Graphs

Canadian Journal of Mathematics
Mathematics
2019English

Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Colouring Square-Free Graphs Without Long Induced Paths

Journal of Computer and System Sciences
Computer NetworksApplied MathematicsCommunicationsComputational TheoryMathematicsTheoretical Computer Science
2019English

Towards Narrowing the Cassava Yield Gap

New Phytologist
Plant SciencePhysiology
2020English

Low Complexity FFT Factorization for CS Reconstruction

International Journal of Engineering and Advanced Technology
EngineeringComputer Science ApplicationsEnvironmental Engineering
2020English

L(t, 1)-Colouring of Wheel Graphs

International Journal of Scientific Research in Mathematical and Statistical Sciences
2017English

Narrowing the Rural-Urban Care Gap in China

Health Affairs
MedicineHealth Policy
2011English

Narrowing the 17-Year Research to Practice Gap

American Journal of Critical Care
MedicineCritical Care Nursing
2016English

On the Gap Between Trivial and Nontrivial Initial Segment Prefix-Free Complexity

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy