A Variant of Reconstructibility of Colored Graphs

International Journal of Pure and Applied Mathematics - Kuwait
doi 10.12732/ijpam.v108i2.20
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Academic Publications

Related search

On the Number of Bi-Colored Graphs

Pacific Journal of Mathematics
Mathematics
1958English

Chromatic Number of Sparse Colored Mixed Planar Graphs

Electronic Notes in Discrete Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2009English

Maximum Cuts in Edge-Colored Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2019English

Colored Spanning Graphs for Set Visualization

Computational Geometry: Theory and Applications
ControlOptimizationGeometryComputational TheoryComputer Science ApplicationsComputational MathematicsMathematicsTopology
2018English

Leaf-Reconstructibility of Phylogenetic Networks

SIAM Journal on Discrete Mathematics
Mathematics
2018English

An Erdős-Gallai Type Theorem for Vertex Colored Graphs

Graphs and Combinatorics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2019English

A Variant on the Graph Parameters of Colin De Verdiere: Implications to the Minimum Rank of Graphs

Electronic Journal of Linear Algebra
Number TheoryAlgebra
2005English

A Colored Version of Tverberg's Theorem

Journal of the London Mathematical Society
Mathematics
1992English

Computer Aided Verification of Lamport's Fast Mutual Exclusion Algorithm Using Colored Petri Nets and Occurrence Graphs With Symmetries

IEEE Transactions on Parallel and Distributed Systems
HardwareComputational TheorySignal ProcessingArchitectureMathematics
1999English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy