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

Discrete Mathematics - Netherlands
doi 10.1016/j.disc.2018.08.017
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

NC Algorithms for Recognizing Chordal Graphs and K Trees

IEEE Transactions on Computers
HardwareArchitectureMathematicsComputational TheoryTheoretical Computer ScienceSoftware
1988English

Distance Approximating Trees for Chordal and Dually Chordal Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1997English

An Introduction to Chordal Graphs and Clique Trees

1992English

Cubic Identity Graphs and Planar Graphs Derived From Trees

Journal of the Australian Mathematical Society
1970English

On the Relationship Between K-Planar and K-Quasi-Planar Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2017English

Clique Graphs of Chordal and Path Graphs

SIAM Journal on Discrete Mathematics
Mathematics
1994English

Complexity of Disjoint Paths Problems in Planar Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1993English

Topological Paths, Cycles and Spanning Trees in Infinite Graphs

European Journal of Combinatorics
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTheoretical Computer ScienceTopology
2004English

Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs

SIAM Journal on Computing
MathematicsComputer Science
1999English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy