scientific article; zbMATH DE number 3383914
From MaRDI portal
Publication:5653953
zbMATH Open0243.00006MaRDI QIDQ5653953FDOQ5653953
Author name not available (Why is that?)
Publication date: 1972
Title of this publication is not available (Why is that?)
Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06) Graph theory (05Cxx) Conference proceedings and collections of articles (00Bxx) Computer science (68-XX) Information and communication theory, circuits (94-XX)
Cited In (19)
- XML compression via directed acyclic graphs
- Fitting very large sparse Gaussian graphical models
- Computing the maximal canonical form for trees in polynomial time
- Set-Valued Graphs: A Survey
- Graph Coloring Using Eigenvalue Decomposition
- A branch-price-and-cut algorithm for the minimum evolution problem
- Strong tree-cographs are Birkhoff graphs
- Generating the Nine-Point Graphs
- Finding minimum height elimination trees for interval graphs in polynomial time
- On even-odd meanness of super subdivision of some graphs
- Automates finis et ensembles normaux. (Finite automata and normal sets)
- Partitioning, tearing and modification of sparse linear systems
- On determining non-isotopic configurations of points on a circle
- A Note On Set-Indexed Graphs
- Graph Relabelling Systems
- Some sequential graph colouring algorithms
- Total difference chromatic numbers of graphs
- One ModuloNGracefulness of Supersubdivision of Ladder
- On multiple grid and related techniques for solving discrete elliptic systems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5653953)
