Amanote Research

Amanote Research

    RegisterSign In

On the Cubicity of AT-Free Graphs and Circular-Arc Graphs

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-02029-2_15
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2009

Authors
L. Sunil ChandranMathew C. FrancisNaveen Sivadasan
Publisher

Springer Berlin Heidelberg


Related search

The 2-Tuple Domination Problem on Circular-Arc Graphs

Journal of Mathematics and Informatics
2017English

Claw-Free Circular-Perfect Graphs

Journal of Graph Theory
GeometryTopology
2010English

Fully Dynamic Recognition of Proper Circular-Arc Graphs

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2013English

On Linear and Circular Structure of (Claw, Net)-Free Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2003English

Induced Disjoint Paths in Circular-Arc Graphs in Linear Time

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

On Criterion of Arc-Transitive Cayley Graphs

Pure Mathematics
2017English

On the Circular Area Signature for Graphs

SIAM Journal on Imaging Sciences
MathematicsApplied Mathematics
2012English

On-Line 3-Chromatic Graphs I. Triangle-Free Graphs

SIAM Journal on Discrete Mathematics
Mathematics
1999English

A Simple Linear Algorithm for the Connected Domination Problem in Circular-Arc Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2004English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy