Colouring Square-Free Graphs Without Long Induced Paths

Journal of Computer and System Sciences - United States
doi 10.1016/j.jcss.2019.06.002
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Induced Disjoint Paths in Claw-Free Graphs

SIAM Journal on Discrete Mathematics
Mathematics
2015English

Colouring Squares of Claw-Free Graphs

Canadian Journal of Mathematics
Mathematics
2019English

Coloring Square-Free Berge Graphs

Journal of Combinatorial Theory. Series B
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2019English

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

Computer Journal
Computer Science
2015English

Induced Disjoint Paths in Circular-Arc Graphs in Linear Time

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

L(t, 1)-Colouring of Wheel Graphs

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

Long Paths and Toughness of K-Trees and Chordal Planar Graphs

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2019English

Long Dominating Cycles and Paths in Graphs With Large Neighborhood Unions

Journal of Graph Theory
GeometryTopology
1991English

Wait-Free Handshaking Using Rainbow Colouring

Computer Journal
Computer Science
2000English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy