Article

Fixed-Point Logics on Planar Graphs

Author:

M. GroheAuthors Info & Claims

LICS '98: Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science

Page 6

Published: 21 June 1998 Publication History

Publisher Site

Abstract

No abstract available.

Cited By

View all

Kiefer S(2020)The Weisfeiler-Leman algorithmACM SIGLOG News10.1145/3436980.34369827:3(5-27)Online publication date: 16-Nov-2020
https://dl.acm.org/doi/10.1145/3436980.3436982
Grohe MNeuen DBouyer P(2019)Canonisation and definability for graphs of bounded rank widthProceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science10.5555/3470152.3470180(1-13)Online publication date: 24-Jun-2019
https://dl.acm.org/doi/10.5555/3470152.3470180
Grußien BAceto LIngólfsdóttir A(2017)Capturing polynomial time using modular decompositionProceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science10.5555/3329995.3330058(1-12)Online publication date: 20-Jun-2017
https://dl.acm.org/doi/10.5555/3329995.3330058
Show More Cited By

Index Terms

Fixed-Point Logics on Planar Graphs
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Graph algorithms
2. Theory of computation
  1. Logic
  2. Semantics and reasoning

Index terms have been assigned to the content through auto-classification.

Recommendations

On stable cutsets in claw-free graphs and planar graphs

A stable cutset in a connected graph is a stable set whose deletion disconnects the graph. Let K"4 and K"1","3 (claw) denote the complete (bipartite) graph on 4 and 1+3 vertices. It is NP-complete to decide whether a line graph (hence a claw-free graph) ...
Adapted list coloring of planar graphs

Given an edge coloring F of a graph G, a vertex coloring of G is adapted to F if no color appears at the same time on an edge and on its two endpoints. If for some integer k, a graph G is such that given any list assignment L to the vertices of G, with |...
Total domination in planar graphs of diameter two

MacGillivary and Seyffarth [G. MacGillivray, K. Seyffarth, Domination numbers of planar graphs, J. Graph Theory 22 (1996) 213-229] proved that planar graphs of diameter two have domination number at most three. Goddard and Henning [W. Goddard, M.A. ...

Comments

Information & Contributors

Information

Published In

LICS '98: Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science

June 1998

ISBN:0818685069

Publisher

IEEE Computer Society

United States

Publication History

Published: 21 June 1998

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

19
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 01 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Kiefer S(2020)The Weisfeiler-Leman algorithmACM SIGLOG News10.1145/3436980.34369827:3(5-27)Online publication date: 16-Nov-2020
https://dl.acm.org/doi/10.1145/3436980.3436982
Grohe MNeuen DBouyer P(2019)Canonisation and definability for graphs of bounded rank widthProceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science10.5555/3470152.3470180(1-13)Online publication date: 24-Jun-2019
https://dl.acm.org/doi/10.5555/3470152.3470180
Grußien BAceto LIngólfsdóttir A(2017)Capturing polynomial time using modular decompositionProceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science10.5555/3329995.3330058(1-12)Online publication date: 20-Jun-2017
https://dl.acm.org/doi/10.5555/3329995.3330058
Kiefer SPonomarenko ISchweitzer PAceto LIngólfsdóttir A(2017)The weisfeiler-leman dimension of planar graphs is at most 3Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science10.5555/3329995.3330042(1-12)Online publication date: 20-Jun-2017
https://dl.acm.org/doi/10.5555/3329995.3330042
Dawar A(2015)The nature and power of fixed-point logic with countingACM SIGLOG News10.1145/2728816.27288202:1(8-21)Online publication date: 28-Jan-2015
https://dl.acm.org/doi/10.1145/2728816.2728820
Grohe M(2012)Fixed-point definability and polynomial time on graphs with excluded minorsJournal of the ACM10.1145/2371656.237166259:5(1-64)Online publication date: 5-Nov-2012
https://dl.acm.org/doi/10.1145/2371656.2371662
Atserias AManeva EGoldwasser S(2012)Sherali-Adams relaxations and indistinguishability in counting logicsProceedings of the 3rd Innovations in Theoretical Computer Science Conference10.1145/2090236.2090265(367-379)Online publication date: 8-Jan-2012
https://dl.acm.org/doi/10.1145/2090236.2090265
Grohe M(2011)From polynomial time queries to graph structure theoryCommunications of the ACM10.1145/1953122.195315054:6(104-112)Online publication date: 1-Jun-2011
https://dl.acm.org/doi/10.1145/1953122.1953150
Grohe M(2010)Fixed-point definability and polynomial time on chordal graphs and line graphsFields of logic and computation10.5555/1983702.1983721(328-353)Online publication date: 1-Jan-2010
https://dl.acm.org/doi/10.5555/1983702.1983721
Schweikardt NSchwentick TSegoufin L(2010)Database theoryAlgorithms and theory of computation handbook10.5555/1882723.1882742(19-19)Online publication date: 1-Jan-2010
https://dl.acm.org/doi/10.5555/1882723.1882742
Show More Cited By

Abstract

Cited By

Index Terms

Recommendations

On stable cutsets in claw-free graphs and planar graphs

Adapted list coloring of planar graphs

Total domination in planar graphs of diameter two

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations